Summary of block A256
Sequences in block A256
Section titled “Sequences in block A256”-
A256008: Self-inverse permutation of positive integers: 4k+1 is swapped with 4k+3, and 4k+2 with 4k+4.
-
A256019: a(n) = Sum_{i=1..n-1} (i^3 * a(i)), a(1)=1.
-
A256020: a(n) = Sum_{i=1..n-1} (i^4 * a(i)), a(1)=1.
-
A256079: Increase each (decimal) digit of n by 1, with carry (i.e., ‘9’ becomes ‘0’ and a (further) increment of 1 of the digit to the left).
-
A256096: Expansion of (4+3*x)/(1+3*x).
-
A256101: The broken eggs problem.
-
A256137: a(2) = 1; a(3) = 4; for n >= 4, a(n) = 2 + Sum_{i=4..n} d(i), where d(i) = i for even i, d(i) = i-3 for odd i.
-
A256233: a(n) = L(2*n+1) - 2, where L is A000032.
-
A256251: First differences of A256250.
-
A256255: Triangle read by rows: T(n,k) = 6*k + 1, n>=0, 0<=k<=(2^n-1).
-
A256302: Least prime p such that p+3*k*(k+1) is prime for all k=0,…,n.
-
A256313: Number of partitions of 3n into exactly 4 parts.
-
A256320: Number of partitions of 4n into exactly 3 parts.
-
A256321: Number of partitions of 5n into exactly 3 parts.
-
A256322: Number of partitions of 7n into exactly 3 parts.
-
A256328: Number of partitions of 6n into exactly 4 parts.
-
A256493: Number of factorizations of m^3 into at most 3 factors, where m is a product of exactly n distinct primes.
-
A256494: Expansion of -x^2*(x^3+x-1) / ((x-1)*(x+1)*(2*x-1)*(x^2+1)).
-
A256509: a(n) = (n!)! - n! - 1.
-
A256511: a(n) = (n^2 - 1)!.
-
A256512: n*(1+(2*n)^n).
-
A256524: Number of partitions of 3n into at most 4 parts.
-
A256573: God’s number for Rubik’s cube size n X n X n (quarter-turn metric).
-
A256646: 26-gonal pyramidal numbers: a(n) = n*(n+1)*(8*n-7)/2.
-
A256649: 29-gonal pyramidal numbers: a(n) = n*(n+1)*(9*n-8)/2.
-
A256666: a(n) = ( 2*n*(2*n^2 + 11*n + 26) - (-1)^n + 1 )/16.
-
A256669: a(n) = (n!)! - n! - n.
-
A256676: Digital roots of centered 11-gonal numbers (A069125).
-
A256680: Minimal most likely sum for a roll of n 4-sided dice.
-
A256718: a(n) = n*(n+1)*(7*n-6)/2.
-
A256832: Product of first n Pell numbers Pell(1), … , Pell(n).
-
A256833: a(n) = (4*n+3)*(4*n+2).
-
A256857: a(n) = n*(n^2 + 3*n - 2)/2.
-
A256859: a(n) = n*(n + 1)*(n + 2)*(n^2 - n + 4)/24.
-
A256871: a(n) = 2^(n-1)*(2^n+11).
-
A256873: a(n) = 2^(n-1)*(2^n+5).
-
A256880: n*n!/round(n/2).
-
A256881: a(n) = n!/ceiling(n/2).
-
A256994: a(n) = n + 1 when n <= 3, otherwise a(n) = 2^(n-2) + 3; also iterates of A005187 starting from a(1) = 2.