Summary of block A164
Sequences in block A164
Section titled “Sequences in block A164”-
A164004: Zero together with row 4 of the array in A163280.
-
A164005: Zero together with row 5 of the array in A163280.
-
A164013: 3 times centered triangular numbers: 9*n*(n+1)/2 + 3.
-
A164015: 5 times centered pentagonal numbers: 5*(5*n^2 + 5*n + 2)/2.
-
A164016: 6 times centered hexagonal numbers: 18*n*(n+1) + 6.
-
A164021: a(n) = 12*a(n-1) - 34*a(n-2) for n > 1; a(0) = 3, a(1) = 22.
-
A164031: a(n) = ((2+3*sqrt(2))*(5+sqrt(2))^n+(2-3*sqrt(2))*(5-sqrt(2))^n)/4.
-
A164033: a(n) = ((4+3*sqrt(2))*(3+sqrt(2))^n + (4-3*sqrt(2))*(3-sqrt(2))^n)/4.
-
A164034: a(n) = ((4+3*sqrt(2))*(4+sqrt(2))^n + (4-3*sqrt(2))*(4-sqrt(2))^n)/4.
-
A164035: a(n) = ((4+3*sqrt(2))*(5+sqrt(2))^n + (4-3*sqrt(2))*(5-sqrt(2))^n)/4.
-
A164037: Expansion of (5-9*x)/(1-6*x+7*x^2).
-
A164039: a(n+1) = 3*a(n) - n.
-
A164044: a(n+1) = 4*a(n) - n.
-
A164045: a(n+1) = 5*a(n) - n.
-
A164051: a(n) = 2^(2n) + 2^(n-1).
-
A164053: Partial sums of A162255.
-
A164072: a(n) = 8*a(n-1) - 14*a(n-2) for n > 1; a(0) = 1, a(1) = 7.
-
A164073: a(n) = 2*a(n-2) for n > 2; a(1) = 1, a(2) = 3.
-
A164080: Perfect squares one less than a triangular number.
-
A164086: Beatty sequence for 4*Pi/3 = 4.1887902… .
-
A164087: Beatty sequence for 4*Pi/(4*Pi-3) = 1.3135986… .
-
A164089: For n >=4, a(n) = the numerical value of the substring of binary n containing all digits but the first and last. a(1) = a(2) = a(3) = 0.
-
A164090: a(n) = 2*a(n-2) for n > 2; a(1) = 2, a(2) = 3.
-
A164093: a(n) = 9*4^n + 2.
-
A164094: a(n) = 3*2^n + 2.
-
A164095: a(n) = 2*a(n-2) for n > 2; a(1) = 5, a(2) = 6.
-
A164096: Partial sums of A164095.
-
A164097: Numbers k such that 6*k + 7 is a perfect square.
-
A164111: Expansion of (1-x)/(1+4*x^2).
-
A164115: Expansion of (1 - x^5) / ((1 - x) * (1 - x^4)) in powers of x.
-
A164117: Expansion of (1 - x) * (1 - x^10) / ((1 - x^2) * (1 - x^4) * (1 - x^5)) in powers of x.
-
A164120: Partial sums of A162396.
-
A164123: Partial sums of A162436.
-
A164131: Numbers k such that k^2 == 2 (mod 31).
-
A164135: Numbers k such that k^2 == 2 (mod 47).
-
A164136: a(n) = 11*n*(n+1).
-
A164143: Number of binary strings of length n with equal numbers of 001 and 100 substrings.
-
A164284: a(n) = 15*n-7.
-
A164285: a(n) = 7*2^n + 3.
-
A164298: a(n) = ((1+4*sqrt(2))*(2+sqrt(2))^n + (1-4*sqrt(2))*(2-sqrt(2))^n)/2.
-
A164299: a(n) = ((1+4*sqrt(2))*(3+sqrt(2))^n + (1-4*sqrt(2))*(3-sqrt(2))^n)/2.
-
A164303: a(n) = 2*a(n-1) + a(n-2) for n > 1; a(0) = 3, a(1) = 11.
-
A164304: a(n) = 4*a(n-1) - 2*a(n-2) for n > 1; a(0) = 3, a(1) = 14.
-
A164305: a(n) = 6*a(n-1) - 7*a(n-2) for n > 1; a(0) = 3, a(1) = 17.
-
A164307: Primes in A081175.
-
A164310: a(n) = 6*a(n-1) - 6*a(n-2) for n > 1; a(0) = 4, a(1) = 15.
-
A164334: Quartic recurrence sequence a(0) = 1, a(n) = n*a(n-1)^4.
-
A164335: Quintic recurrence sequence a(0) = 1, a(n) = n*a(n-1)^5.
-
A164346: a(n) = 3 * 4^n.
-
A164356: Expansion of (1 - x^2)^4 / ((1 - x)^4 * (1 - x^4)) in powers of x.
-
A164358: Expansion of (1 - x^2)^2 * (1 - x^3) / ((1 - x)^3 * (1 - x^4)) in powers of x.
-
A164359: Expansion of (1 - x^2)^3 / ((1 - x)^3 * (1 - x^3)) in powers of x.
-
A164360: Period 3: repeat [5, 4, 3].
-
A164367: a(n) = A164051(n) in base 2.
-
A164386: Numbers which are not 1 larger than a nonzero square.
-
A164397: Number of binary strings of length n with no substrings equal to 0001 or 0111.
-
A164412: Number of binary strings of length n with no substrings equal to 0000 0001 or 0111.
-
A164485: Number of binary strings of length n with no substrings equal to 0001, 1000 or 1001.
-
A164486: Duplicate of A084684.
-
A164514: 1 followed by numbers that are not squares.
-
A164515: Positive numbers not of the form n^2+2.
-
A164532: a(n) = 6*a(n-2) for n > 2; a(1) = 1, a(2) = 4.
-
A164539: a(n) = 2*a(n-1) + 7*a(n-2) for n > 1; a(0) = 1, a(1) = 13.
-
A164540: a(n) = 4*a(n-1) + 4*a(n-2) for n > 1; a(0) = 1, a(1) = 14.
-
A164541: a(n) = 6*a(n-1) - a(n-2) for n > 1; a(0) = 1, a(1) = 15.
-
A164542: a(n) = 8*a(n-1) - 8*a(n-2) for n > 1; a(0) = 1, a(1) = 16.
-
A164543: a(n) = 10*a(n-1) - 17*a(n-2) for n > 1; a(0) = 1, a(1) = 17.
-
A164544: a(n) = 2*a(n-1) + 7*a(n-2) for n > 1; a(0) = 1, a(1) = 7.
-
A164545: a(n) = 4*a(n-1) + 4*a(n-2) for n > 1; a(0) = 1, a(1) = 8.
-
A164546: a(n) = 8*a(n-1) - 8*a(n-2) for n > 1; a(0) = 1, a(1) = 10.
-
A164549: a(n) = 4*a(n-1) + 2*a(n-2) for n > 1; a(0) = 1, a(1) = 6.
-
A164550: a(n) = 6*a(n-1) - 3*a(n-2) for n > 1; a(0) = 1, a(1) = 7.
-
A164551: a(n) = 10*a(n-1)-19*a(n-2) for n > 1; a(0) = 1, a(1) = 9.
-
A164552: a(n) = 12*a(n-1)-30*a(n-2) for n > 1; a(0) = 1, a(1) = 10.
-
A164559: a(n) = 6^n/3 - 1.
-
A164560: Partial sums of A164532.
-
A164576: Integer averages of the set of the first positive squares up to some n^2.
-
A164581: a(n) = 5*a(n - 1) + a(n - 2), with a(0)=1, a(1)=2.
-
A164582: a(n) = 5*a(n - 1) - a(n - 2), with n>2, a(1)=2, a(2)=3.
-
A164583: a(n) = 4^n*(2n + 1)^2.
-
A164584: Expansion of (1 + 6*x - 12*x^2 - 8*x^3)/(1 - 24*x^2 + 16*x^4).
-
A164587: a(n) = 2*a(n - 2) for n > 2; a(1) = 1, a(2) = 8.
-
A164588: a(n) = ((3 + sqrt(18))*(5 + sqrt(8))^n + (3 - sqrt(18))*(5 - sqrt(8))^n)/6.
-
A164589: a(n) = ((4 + 3*sqrt(2))*(1 + 2*sqrt(2))^n + (4 - 3*sqrt(2))*(1 - 2*sqrt(2))^n)/8.
-
A164591: a(n) = ((4 + sqrt(18))*(4 + sqrt(8))^n + (4 - sqrt(18))*(4 - sqrt(8))^n)/8 .
-
A164592: a(n) = 10*a(n-1) - 17*a(n-2) for n > 1; a(0) = 1, a(1) = 8.
-
A164593: a(n) = ((5 + sqrt(18))*(2 + sqrt(8))^n + (5 - sqrt(18))*(2 - sqrt(8))^n)/2.
-
A164594: a(n) = ((5 + sqrt(18))*(4 + sqrt(8))^n + (5 - sqrt(18))*(4 - sqrt(8))^n)/2.
-
A164602: a(n) = ((1+4*sqrt(2))*(1+2*sqrt(2))^n + (1-4*sqrt(2))*(1-2*sqrt(2))^n)/2.
-
A164603: a(n) = ((1+4*sqrt(2))*(2+2*sqrt(2))^n + (1-4*sqrt(2))*(2-2*sqrt(2))^n)/2.
-
A164604: a(n) = ((1+4*sqrt(2))*(3+2*sqrt(2))^n + (1-4*sqrt(2))*(3-2*sqrt(2))^n)/2.
-
A164605: a(n) = ((1+4*sqrt(2))*(4+2*sqrt(2))^n + (1-4*sqrt(2))*(4-2*sqrt(2))^n)/2.
-
A164607: a(n) = 4*a(n-1) + 4*a(n-2) for n > 1; a(0) = 1, a(1) = 10.
-
A164608: Expansion of (1+4*x)/(1-8*x+8*x^2).
-
A164611: Expansion of (1 + x + 2*x^2 - x^3)/(1 - 2*x + 3*x^2 - 2*x^3 + x^4).
-
A164640: a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 6.
-
A164654: a(n) = 2*a(n-2) for n > 2; a(1) = 3, a(2) = 8.
-
A164675: a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 12.
-
A164682: a(n) = 2*a(n-2) for n > 2; a(1) = 5, a(2) = 8.
-
A164683: a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 8.
-
A164703: a(n) = 8*a(n-2) for n > 2; a(1) = 1, a(2) = 16.
-
A164737: a(n) = 8*a(n-2) for n > 2; a(1) = 5, a(2) = 12.
-
A164743: Digital root of 3*A000045(n).
-
A164754: Number of n X 2 1..4 arrays with all 1’s connected, all 2’s connected, all 3’s connected, all 4’s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.
-
A164783: a(n) = 7^n-6.
-
A164784: a(n) = 6^n-5.
-
A164785: a(n) = 5^n - 4.
-
A164786: a(n) = 8^n-7.
-
A164827: Generalized Lucas numbers: a(n) = a(n-1) + 10*a(n-2); with a(1)=2 a(2)=1.
-
A164839: Left-truncatable squares: every suffix is square.
-
A164845: a(n) = (6 + 10*n + 5*n^2 + n^3)/2.
-
A164894: Base-10 representation of the binary string formed by appending 10, 100, 1000, 10000, …, etc., to 1.
-
A164897: a(n) = 4*n*(n+1) + 3.
-
A164900: a(2n) = 4*n*(n+1) + 3; a(2n+1) = 2*n*(n+2) + 3.
-
A164906: Duplicate of A056450.
-
A164907: a(n) = (3*3^n-(-1)^n)/2.
-
A164908: a(n) = (3*4^n - 0^n)/2.
-
A164938: a(n) = (n^5 - n)/10, which is always an integer.
-
A164950: 1 if there is a winning strategy for misère Sprouts with n initial points, else 0.
-
A164965: Cumulative sums of A010892.