Summary of block A153
Sequences in block A153
Section titled “Sequences in block A153”-
A153026: a(1)=0, a(n) = n^3 - a(n-1).
-
A153037: a(n) = 2*n^2 + 16*n + 23.
-
A153056: a(0)=2, a(n) = n^2+a(n-1).
-
A153057: a(0)=3; a(n) = n^2 + a(n-1) for n>0.
-
A153058: a(0)=4; a(n)=n^2+a(n-1) for n>0.
-
A153059: a(0) = 0, a(n) = a(n-1)^2 - n.
-
A153060: a(0)=4, a(n)=a(n-1)^2 - n for n > 0.
-
A153061: a(-1) = 2, a(n) = a(n-1)^2 + n.
-
A153062: a(0)=1, a(n)=a(n-1)^2-n^2.
-
A153079: a(n) = 13^n + 2.
-
A153080: a(n) = 13*n + 2.
-
A153110: Period 6: repeat [1, 5, 7, 2, 4, 8].
-
A153111: Solutions of the Pell-like equation 1 + 6*A*A = 7*B*B, with A, B integers.
-
A153126: Sums of rows of the triangle in A153125.
-
A153127: a(n) = (2*n + 1)*(5*n + 6).
-
A153130: Period 6: repeat [1, 2, 4, 8, 7, 5].
-
A153169: a(n) = 4*n^2 + 12*n + 3.
-
A153191: a(n) = 9*a(n-1) + 6*a(n-2); a(0)=0, a(1)=1.
-
A153192: Numbers such that the numerator of floor(sqrt(n))/n, when reduced to its lowest terms, is equal to 2.
-
A153229: a(0) = 0, a(1) = 1, and for n >= 2, a(n) = (n-1) * a(n-2) + (n-2) * a(n-1).
-
A153231: a(n) = 2^n * binomial(3n,n)/(2n+1).
-
A153234: a(n) = floor(2^n/9).
-
A153237: a(n) = A000079(n) - A153130(n).
-
A153257: a(n) = n^3 - (n+1)^2.
-
A153258: n^3 - (n+2)^2.
-
A153263: a(n) = A014217(n+3) - A014217(n).
-
A153280: Eigensequence of triangle A153279.
-
A153284: a(n) = n + Sum_{j=1..n-1} (-1)^j * a(j) for n >= 2, a(1) = 1.
-
A153315: Denominators of continued fraction convergents to sqrt(5/4).
-
A153316: Numerators of continued fraction convergents to sqrt(5/4).
-
A153339: Number of zig-zag paths from top to bottom of a rectangle of width 5 with n rows whose color is that of the top right corner.
-
A153349: Period 6: repeat [1, 7, 4, 4, 7, 1].
-
A153365: Number of zig-zag paths from top to bottom of a rectangle of width 9 with 2*n rows whose color is that of the top right corner.
-
A153367: Number of zig-zag paths from top to bottom of a rectangle of width 9 with 2n-1 rows whose color is not that of the top right corner.
-
A153382: a(n) = a(n-1) + 2*a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18.
-
A153388: Second bisection of A153382.
-
A153448: 3 times 12-gonal (or dodecagonal) numbers: a(n) = 3*n*(5*n-4).
-
A153449: 11 times pentagonal numbers: 11*n*(3n-1)/2.
-
A153465: a(n) = 9*4^n - 2.
-
A153466: a(n) = A027941(n) + A027941(n+6).
-
A153509: Period 9: repeat [6, 6, 6, 3, 3, 3, 0, 0, 0].
-
A153511: a(n) = 4 * A051189(n).
-
A153594: a(n) = ((4 + sqrt(3))^n - (4 - sqrt(3))^n)/(2*sqrt(3)).
-
A153596: a(n) = ((5 + sqrt(3))^n - (5 - sqrt(3))^n)/(2*sqrt(3)).
-
A153638: Odiousness of triangular numbers.
-
A153639: Evilness of triangular numbers.
-
A153642: a(n) = 4*n^2 + 24*n + 8.
-
A153643: Jacobsthal numbers A001045 incremented by 2.
-
A153644: a(n) = 4*n^2 + 28*n + 10.
-
A153647: a(n) = 3^n*(n + 2)!.
-
A153703: Partial sums of A069996.
-
A153727: Period 3: repeat [1, 4, 2] ; Trajectory of 3x+1 sequence starting at 1.
-
A153733: Remove all trailing 1’s in the binary representation of n.
-
A153757: a(n) = Sum_{k=1..n} A003266(k).
-
A153772: a(n) = (2^n + 2*(-1)^n - 6)/3.
-
A153773: a(2*n) = 3*a(2*n-1) - 1, a(2*n+1) = 3*a(2*n), with a(1)=1.
-
A153774: a(2*n) = 3*a(2*n-1), a(2*n+1) = 3*a(2*n) - 1, with a(1) = 1.
-
A153778: Binary sequence constructed like a Stern-Brocot tree between 0 and 1, where XOR is applied instead of the mediant operation.
-
A153780: 10 times pentagonal numbers: a(n) = 5*n*(3*n-1).
-
A153783: 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3*n*(9*n-7)/2.
-
A153784: 4 times heptagonal numbers: a(n) = 2*n*(5*n-3).
-
A153785: 5 times heptagonal numbers: a(n) = 5*n*(5*n-3)/2.
-
A153786: 6 times heptagonal numbers: a(n) = 3*n*(5*n-3).
-
A153792: 12 times pentagonal numbers: a(n) = 6*n*(3*n-1).
-
A153793: 13 times pentagonal numbers: a(n) = 13*n*(3*n-1)/2.
-
A153794: 4 times octagonal numbers: a(n) = 4*n*(3*n-2).
-
A153795: 5 times octagonal numbers: a(n) = 5*n*(3*n-2).
-
A153796: 6 times octagonal numbers: a(n) = 6*n*(3*n-2).
-
A153797: 7 times octagonal numbers: a(n) = 7*n*(3*n-2).
-
A153808: 8 times octagonal numbers: 8*n*(3*n-2).
-
A153814: a(n) = 1001*n.
-
A153819: Linear recurrence with a(n) = 3a(n-1) - a(n-2) + 2 = 4a(n-1) - 4a(n-2) + a(n-3). Full sequence for A153466.
-
A153848: a(n) = 7*(10^(2*n) - 1)/33.
-
A153873: a(n) = 9*Fibonacci(2n+1) - 1.
-
A153875: 3 times 13-gonal (or tridecagonal) numbers: a(n) = 3*n*(11*n - 9)/2.
-
A153881: 1 followed by -1, -1, -1, … .
-
A153884: a(n) = ((7 + sqrt(5))^n - (7 - sqrt(5))^n)/(2*sqrt(5)).
-
A153893: a(n) = 3*2^n - 1.
-
A153894: a(n) = 5*2^n - 1.
-
A153972: a(n) = 2^n + 6.
-
A153973: a(n) = 3*a(n-1) - 2*a(n-2), with a(1) = 9, a(2) = 12.
-
A153976: a(n) = n^3 + (n+2)^3.
-
A153977: One-fourth of partial sums of A153976.
-
A153978: a(n) = n*(n-1)*(n+1)*(3*n-2)/12.
-
A153981: a(n) = 36*Fibonacci(2*n+1) - 4.
-
A153990: Period 6: repeat [1, 2, 5, 4, 7, 8].