Summary of block A127
Sequences in block A127
Section titled “Sequences in block A127”-
A127065: a(n) = n! - (n-2)^2.
-
A127069: Number of lines in a Pauli graph of order n.
-
A127081: One-sided kissing number for spheres in n-dimensional Euclidean space.
-
A127146: Q(n,4), where Q(m,k) is defined in A127080 and A127137.
-
A127210: a(n) = 3^n*Lucas(n), where Lucas = A000204.
-
A127212: a(n) = 5^n*Lucas(n), where Lucas = A000204.
-
A127213: a(n) = 6^n*Lucas(n), where Lucas = A000204.
-
A127223: a(n) = (n^2)!/n!.
-
A127225: a(n) = (n^4)!/n!.
-
A127226: a(n) = 2*a(n-1) + 6*a(n-2) with a(0)=2, a(1)=2.
-
A127228: a(n) = numerator of ((n + 4)! - (n - 4)!)/(n!).
-
A127230: a(n) = (2n)! - 1.
-
A127231: a(n) = (2n)! + 1.
-
A127233: a(n) = n!*(n*(n+1)/2)!.
-
A127234: a(n) = n! (sum(1..n-1))!.
-
A127235: a(n) = n! (2*sum(1..n-1))!.
-
A127245: Row sums of a signed Thue-Morse related triangle.
-
A127254: (0,1) sequence whose zero positions are indexed by twice the odious numbers given by A091855.
-
A127261: a(0)=2, a(1)=2, a(n) = 2*a(n-1) + 10*a(n-2).
-
A127262: a(0)=2, a(1)=2, a(n) = 2*a(n-1) + 12*a(n-2).
-
A127276: Hankel transform of A127275.
-
A127282: Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A126315/A126316.
-
A127316: a(n) = 2*n^2 - 4*n + 73.
-
A127317: Numbers n such that (256^n + 1)/257 is prime.
-
A127357: Expansion of 1/(1 - 2*x + 9*x^2).
-
A127365: Signed repeated natural numbers.
-
A127369: (n^3+n)*4^n.
-
A127407: Negative value of coefficient of x^(n-2) in the characteristic polynomial of a certain n X n integer circulant matrix.
-
A127427: a(n) = v_3( (6n)! ) - v_3( (3n)! ), where v_3(N) is the 3-adic valuation A007949(N).
-
A127429: 2^(n*(n-1)/2) - n!.
-
A127451: Beatty sequence for 1/(1 - e^Pi + Pi^e), complement of A127450.
-
A127500: On the triangular peg solitaire board of side n, the shortest solution to any problem beginning with one peg missing and ending with one peg.
-
A127509: Number of n-tuples where each entry is chosen from the subsets of {1,2,3} such that the intersection of all n entries contains exactly one element.
-
A127546: a(n) = F(n)^2 + F(n+1)^2 + F(n+2)^2, where F(n) denotes the n-th Fibonacci number.
-
A127547: a(n) = 13*n + 4.
-
A127610: a(n) = floor(( (n+1)/2 )^n) - n!.
-
A127630: Expansion of (1+x-x^2-x^3)/(1+x^2)^2.
-
A127650: n^n - (2n-1)!!.
-
A127670: Discriminants of Chebyshev S-polynomials A049310.
-
A127690: a(1)=3; for n>1, a(n) is such that a(1)^2+…+a(n)^2 = (1+a(n))^2.
-
A127736: a(n) = n*(n^2 + 2*n - 1)/2.
-
A127854: Largest number k such that k^2 divides A007781(6n+1).
-
A127858: Positive integers n such that r(n^2)=r(n)^2, where r is the cyclic replacement map of the digits d of n in base 12, that is, d->d+1 if d<11 and d->0 if d=11.
-
A127859: a(n) = r(A127858(n)), where r if the cyclic replacement map of the digits d of n in base 12 defined by d->d+1 if d<11 and d->0 if d=11.
-
A127864: Number of tilings of a 2 X n board with 1 X 1 and L-shaped tiles (where the L-shaped tiles cover 3 squares).
-
A127873: a(n) = (n^3)/2 + (3*n^2)/2 + 3*n + 3.
-
A127876: Integers of the form (x^3)/6 + (x^2)/2 + x + 1.
-
A127884: a(n) = floor(Fibonacci(n)/n).
-
A127904: Smallest m such that A008687(m) = n.
-
A127932: a(4*n) = 4*n+1, a(4*n+1) = a(4*n+2) = a(4*n+3) = 4*n+4.
-
A127945: Hankel transform of central coefficients of (1+k*x-2x^2)^n, k arbitrary integer.
-
A127946: Hankel transform of central coefficients of (1+k*x-3x^2)^n, k arbitrary integer.
-
A127947: Hankel transform of central coefficients of (1+k*x+5x^2)^n, k arbitrary integer.
-
A127960: a(n) = n^2*3^n.
-
A127961: a(n) = A007583(n) written in binary.
-
A127966: a(n) = number of 4-times (but not 5-times) reformable permutation of {1,…,n}.
-
A127968: a(n) = F(n+1) + (1-(-1)^n)/2, where F() = Fibonacci numbers A000045.
-
A127975: Repeat 3^n three times.
-
A127980: a(n) = (n + 2/3)*2^(n-1) - 1/2 - (-1)^(n-1)*(1/6).
-
A127981: a(n) = (n + 1/3)*2^(n-1) - 1/2 + (-1)^(n-1)*(1/6).
-
A127982: a(n) = (n - 1/3)*2^n - n/2 + 1/4 + (-1)^n/12.
-
A127983: a(n) = (n - 2/3)*2^n - n/2 + 3/4 - (-1)^n/12.
-
A127984: a(n) = (n/3 + 7/9)*2^(n - 1) + (-1)^n/9.
-
A127985: a(n) = floor(2^n*(n/3 + 4/9)).
-
A127986: a(n) = n! + 2^n - 1.
-
A127989: a(n) = 2*n^3 - 2*n + 9.