Summary of block A275
Sequences in block A275
Section titled “Sequences in block A275”-
A275002: a(n) = 2*n^(2*n^2 + 2).
-
A275016: a(n) = (2^n - (-1+i)^n - (-1-i)^n)/4 - 1 where i is the imaginary unit.
-
A275064: Number of permutations p of [n] such that p(i)-i is a multiple of nine for all i in [n].
-
A275138: Number of n X 4 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,-2) or (0,-1) and new values introduced in order 0..2.
-
A275163: a(n) = 13*2^(n+1) - 19.
-
A275203: Hyperoperations using consecutive integers.
-
A275229: Number of 3 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,0) and new values introduced in order 0..2.
-
A275324: Expansion of (x*(1-4*x^2)^(-3/2) + (1-4*x^2)^(-1/2) + x + 1)/2.
-
A275338: Smallest prime p where a base b with 1 < b < p exists such that b^(p-1) == 1 (mod p^n).
-
A275365: a(1)=2, a(2)=2; thereafter a(n) = a(n-a(n-1)) + a(n-a(n-2)).
-
A275378: Number of odd prime factors (with multiplicity) of generalized Fermat number 5^(2^n) + 1.
-
A275496: a(n) = n^2*(2*n^2 + (-1)^n).
-
A275505: Number of 5 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.
-
A275535: a(n) = the smallest positive multiple of n that is the sum of more than 1 consecutive positive integers.
-
A275540: a(n) = n! + n!! - n - 1.
-
A275541: (n)! + (n + 1)!!/(n + 1) - 2.
-
A275543: A081585 and A069129 interleaved.
-
A275574: ((-1)^n - 1 + 2*(n^floor((n + 1)/2)))/4.
-
A275587: a(1) = 0; thereafter a(n) = s^s where s = Sum_{k=1..n-1} a(k).
-
A275591: a(n) = n^2 + 9*n + 1.
-
A275607: a(n) = 2*12^n*Gamma(n+1/2)*(n+1)/(sqrt(Pi)*Gamma(n+3)).
-
A275611: a(0) = 1, a(n) = n * a(n-1)^2 + a(n-1).
-
A275615: Decimal expansion of 22/111.
-
A275636: a(n) = (3^n-1)*(3^n+3)/3!.
-
A275645: Numbers n such that the n X n queens graph is colorable with n colors.
-
A275646: a(n) = maximal value of M such that it is possible to partition the 2^n vertices of the n-cube into M subsets so that the Hamming distance between any two subsets is exactly 1.
-
A275664: a(n) is the sum of the LCM and GCD of all previous terms, with a(0) = 2.
-
A275672: Size of a largest subset of a regular cubic lattice of n*n*n points without repeated distances.
-
A275673: List of numbers that are in a spoke of a hexagonal spiral.
-
A275698: a(0) = 2, after that a(n) is 3 plus the least common multiple of previous terms.
-
A275704: Digital root of n + (n+1)^2.
-
A275709: a(n) = 2*n^3 + 3*n^2.
-
A275766: a(n) = (5^(2*(n + 1)) - 1)/4.
-
A275779: a(n) = (2^(n^2) - 1)/(1 - 1/2^n).
-
A275794: One half of the y members of the positive proper solutions (x = x1(n), y = y1(n)) of the first class for the Pell equation x^2 - 2*y^2 = +7^2.
-
A275795: The x members of the positive proper solutions (x = x2(n), y = y2(n)) of the second class for the Pell equation x^2 - 2*y^2 = +7^2.
-
A275796: One half of the y members of the positive proper solutions (x = x2(n), y = y2(n)) of the second class for the Pell equation x^2 - 2*y^2 = +7^2.
-
A275854: Number of labeled directed graphs on n nodes (allowing self loops) such that the out-degree of each node is at most 2.
-
A275862: floor(r*a(n-1)) + floor(r*a(n-2)), where r = 3/2, a(0) = 1, a(1) = 1.
-
A275865: Floor(r*a(n-1)) - floor(r*a(n-2)), where r = 3/2, a(0) = 1, a(1) = 1.
-
A275874: a(n) = (n-4)*(n+1)*(n+3)/6.
-
A275876: a(n) = 4*n*(n^2 - 3*n - 1)/3.
-
A275910: Numbers not congruent to 0, 1 or 8 mod 9.
-
A275929: a(n) = 2*(n-1)! + n + 1.
-
A275970: a(n) = 3*2^n + n - 1.
-
A275973: A binary sequence due to Harold Jeffreys.