Summary of block A136
Sequences in block A136
Section titled “Sequences in block A136”-
A136006: a(n) = n^6 - n^3.
-
A136008: a(n) = n^6 - n^2.
-
A136016: a(n) = 9*n^2-1.
-
A136017: a(n) = 36n^2 - 1.
-
A136038: a(n) = n^6 - n^4.
-
A136119: Limiting sequence when we start with the positive integers (A000027) and delete in step n >= 1 the term at position n + a(n).
-
A136169: a(n) = 2*a(n-1) - [(n+1)/3] for n>0 with a(0) = 1.
-
A136188: Digital roots of the Fermat numbers in A000215(n).
-
A136252: a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3).
-
A136254: Generator for the finite sequence A053016.
-
A136258: a(n) = 2*a(n-1) - 2*a(n-2), with a(0)=1, a(1)=5.
-
A136272: Waterbird take-off sequence. Complement of A166021.
-
A136276: Consider pairs of nonnegative integers (m,k) such that 2^2 + 4^2 + 6^2 + … + (2m)^2 = k(k+1); sequence gives k values.
-
A136289: Start with three pennies touching each other on a tabletop. In each generation, add pennies subject to the rule that a penny can be placed only when (at least) two pennies are already in position to determine its position; sequence gives number of pennies added at generation n.
-
A136290: a(0)=1, a(1)=3, a(2)=9, a(3)=12, a(4)=15; thereafter a(n) = a(n-1) + a(n-3) - a(n-4).
-
A136293: Linear bound on the genera of Heegaard splittings of closed, orientable 3-manifolds that admit a generalized triangulation with n generalized tetrahedra.
-
A136308: a(n) = (10^2^n - 1)/9.
-
A136313: a(1) = 1; for n>1, a(n) = a(n-1) + 8 mod 22.
-
A136316: a(n) = 13 + 12*n - n^2.
-
A136320: Terms of A047241 swapped in pairs.
-
A136324: Interleaving of A002450(n), A002450(n) + 1.
-
A136325: a(n) = 8*a(n-1)-a(n-2) with a(0)=0 and a(1)=3.
-
A136326: a(n) = a(n-1) + 4a(n-2) - 4a(n-3).
-
A136336: a(n) = a(n-1) + 4*a(n-2) - 4*a(n-3) for n>3.
-
A136376: a(n) = n*F(n) + (n-1)*F(n-1).
-
A136391: a(n) = n*F(n) - (n-1)*F(n-1), where the F(j)‘s are the Fibonacci numbers (F(0)=0, F(1)=1).
-
A136392: a(n) = 6*n^2 - 10*n + 5.
-
A136395: Binomial transform of [1, 3, 4, 3, 2, 0, 0, 0, …].
-
A136396: a(n) = 1 + n*(n+1)*(n^2-n+12)/12.
-
A136401: a(n) = 3*a(n-1) - 4*a(n-2) + 6*a(n-3) - 4*a(n-4), with initial terms 0,0,0,1.
-
A136411: a(n) = Product_{k=1..n} (2*k-1)^(2*n-2*k+1).
-
A136412: a(n) = (5*4^n + 1)/3.
-
A136417: Number of squares <= 2^n.
-
A136421: a(n) = floor((x^n - (1-x)^n)/sqrt(2)+ 1/2) where x = (sqrt(2)+1)/2.
-
A136422: Floor((x^n - (1-x)^n)/sqrt(3)+.5) where x = (sqrt(3)+1)/2.
-
A136423: Floor((x^n - (1-x)^n)/2 +.5) where x = (sqrt(4)+1)/2 = 3/2.
-
A136434: Duplicate of A121670.
-
A136488: a(n) = 2^n - A005418(n).
-
A136516: a(n) = (2^n+1)^n.
-
A136574: Row sums of triangle A136573.
-
A136580: Row sums of triangle A136579.
-
A136591: Column 1 of triangle A136590.
-
A136616: a(n) = largest m with H(m) - H(n) <= 1, where H(i) = Sum_{j=1 to i} 1/j, the i-th harmonic number, H(0) = 0.
-
A136619: a(1) = 1, then repeat period 3: [1, 4, 2].
-
A136719: Number of labeled directed trees with n nodes.
-
A136724: Numbers divisible by 4 that are not powers of 2.
-
A136725: Primitive dimensions of Hadamard matrices.
-
A136775: Number of multiplex juggling sequences of length n, base state <1,1> and hand capacity 2.
-
A136784: Number of primitive multiplex juggling sequences of length n, base state <3> and hand capacity 3.
-
A136796: Number of labeled marked rooted trees with n nodes.
-
A136797: Number of labeled marked trees with n nodes.
-
A136807: Hankel transform of double factorial numbers n!*2^n=A000165(n).
-
A136853: Numbers k such that k and k^2 use only the digits 0, 1, 3 and 9.
-
A136859: Numbers k such that k and k^2 use only the digits 0, 1, 4 and 6.
-
A136921: Numbers k such that k and k^2 use only the digits 0, 2, 6 and 7.
-
A136957: Numbers k such that k and k^2 use only the digits 0, 4, 6 and 9.
-
A136986: Numbers k such that k and k^2 use only the digits 1, 2 and 4.