Summary of block A125
Sequences in block A125
Section titled “Sequences in block A125”-
A125025: Lengths of rows in A124570.
-
A125046: Partial sums of A003095.
-
A125082: a(n) = n^4 - n^3 - n^2 - n - 1.
-
A125083: a(n) = n^5-n^4-n^3-n^2-n-1.
-
A125107: Subtract compositions (A011782) from Catalan numbers (A000108).
-
A125119: Values of repunits with odd length L in base (L+3)/2 representation.
-
A125122: First differences of A034888.
-
A125128: a(n) = 2^(n+1) - n - 2, or partial sums of main diagonal of array A125127 of k-step Lucas numbers.
-
A125145: a(n) = 3a(n-1) + 3a(n-2). a(0) = 1, a(1) = 4.
-
A125169: a(n) = 16*n + 15.
-
A125176: Row sums of A125175.
-
A125200: a(n) = n*(4*n^2 + n - 1)/2.
-
A125201: a(n) = 8*n^2 - 7*n + 1.
-
A125202: a(n) = 4*n^2 - 6*n + 1.
-
A125295: Number of different non-self-crossing ways of moving a tower of Hanoi from one peg onto another peg.
-
A125521: a(n) is the minimal difference between two distinct n-digit numbers with property that when one of them is typed into a calculator and rotated 180 degrees, the other one is seen.
-
A125558: Central column of triangle A090181.
-
A125577: a(0) = 1; for n >= 1, a(n) = n^2 - a(n-1).
-
A125592: Evil numbers (A001969) multiplied by 2.
-
A125598: a(n) = ((n+1)^(n-1) - 1)/n.
-
A125620: Minimal number of blocks in any (n,3)-splitting system.
-
A125622: Minimal number of blocks in any splitting system ex(n, {123}, {124}, {134}).
-
A125641: Square of the (3,1)-entry of the 3 X 3 matrix M^n, where M = [1,0,0; 1,1,0; 1,i,1].
-
A125650: Numerator of n(n+3)/(4(n+1)(n+2)) = sum(k=1..n, 1/(k(k+1)(k+2)) ).
-
A125651: Numbers k such that A125650(k) is a perfect square.
-
A125678: a(0) = 1; for n>0, a(n) = (a(n-1)^2 reduced mod n) + 1.
-
A125682: a(n) = 3*(6^n - 1)/5.
-
A125687: The base 6 numbers 4 44 444 4444 44444 … converted to base 10.
-
A125725: Numbers whose base-7 representation is 222…2.
-
A125729: Numbers whose base 7 representation is 555…5.
-
A125758: Numbers congruent to 4 or 7 (mod 9).
-
A125760: a(n) = Product_{k=1..n} A002109(k).
-
A125763: Numbers k such that k^2 is a term of A120329.
-
A125791: a(n) = 2^(n*(n-1)*(n-2)/6) for n>=1.
-
A125816: a(n) = ((1+sqrt(13))^n + (1-sqrt(13))^n)/2.
-
A125818: a(n) = ((1 + 3*sqrt(2))^n + (1 - 3*sqrt(2))^n)/2.
-
A125823: Numbers whose base 7 representation is 4444…4.
-
A125831: a(n) = (5^n - 1)/2.
-
A125833: Numbers whose base-5 representation is 333333…3.
-
A125835: Numbers whose base-8 or octal representation is 22222222…2.
-
A125836: Numbers whose base 8 or octal representation is 555555555…5.
-
A125837: a(n) = 6*(8^n - 1)/7.
-
A125857: Numbers whose base-9 representation is 22222222…2.
-
A125894: a(n) = floor(((1+sqrt(2))/2)^n).
-
A125895: a(n) = floor(((1+sqrt(3))/2)^n).
-
A125905: a(0) = 1, a(1) = -4, a(n) = -4*a(n-1) - a(n-2) for n > 1.
-
A125925: Sprague-Grundy values for octal game .351.
-
A125962: Numbers whose base-9 representation is 555555555…5.