Summary of block A163
Sequences in block A163
Section titled “Sequences in block A163”-
A163062: a(n) = ((3+sqrt(5))*(1+sqrt(5))^n + (3-sqrt(5))*(1-sqrt(5))^n)/2.
-
A163063: Lucas(3n+2) = Fibonacci(3n+1) + Fibonacci(3n+3).
-
A163064: a(n) = ((3+sqrt(5))*(4+sqrt(5))^n + (3-sqrt(5))*(4-sqrt(5))^n)/2.
-
A163065: a(n) = ((3+sqrt(5))*(5+sqrt(5))^n + (3-sqrt(5))*(5-sqrt(5))^n)/2.
-
A163069: a(n) = ((4+sqrt(5))*(1+sqrt(5))^n + (4-sqrt(5))*(1-sqrt(5))^n)/2.
-
A163070: a(n) = ((4+sqrt(5))*(2+sqrt(5))^n + (4-sqrt(5))*(2-sqrt(5))^n)/2.
-
A163071: a(n) = ((4+sqrt(5))*(3+sqrt(5))^n + (4-sqrt(5))*(3-sqrt(5))^n)/2.
-
A163073: a(n) = ((5+sqrt(5))*(4+sqrt(5))^n + (5-sqrt(5))*(4-sqrt(5))^n)/10.
-
A163102: a(n) = n^2*(n+1)^2/2.
-
A163114: a(n) = 5*a(n-2) for n > 2; a(1) = 3, a(2) = 5.
-
A163141: a(n) = 5*a(n-2) for n > 2; a(1) = 4, a(2) = 5.
-
A163147: a(n) = 14*a(n-1) - 44*a(n-2) for n > 1; a(0) = 1, a(1) = 12.
-
A163165: a(n) = 20*a(n-1) - 96*a(n-2) for n > 1; a(0) = 1, a(1) = 10.
-
A163198: Sum of the cubes of the first n even-indexed Fibonacci numbers.
-
A163199: Sum of the cubes of the first n even-indexed Fibonacci numbers, minus 1.
-
A163227: Fibonacci-accumulation sequence.
-
A163271: Numerators of fractions in a ‘zero-transform’ approximation of sqrt(2) by means of a(n) = (a(n-1) + c)/(a(n-1) + 1) with c=2 and a(1)=0.
-
A163274: a(n) = n^4*(n+1)^2/2.
-
A163275: a(n) = n^5*(n+1)^2/2.
-
A163276: a(n) = n^6*(n+1)^2/2.
-
A163277: a(n) = n^7*(n+1)^2/2.
-
A163279: a(n) = (n^6 + 2n^5 + 2n^4 + n^3 + 2n)/2.
-
A163300: Even numbers without 2.
-
A163302: Duplicate of A084057.
-
A163305: Numerators of fractions in the approximation of the square root of 5 satisfying: a(n)= (a(n-1)+ c)/(a(n-1)+1); with c=5 and a(1)=0. Also product of the powers of two and five times the Fibonacci numbers.
-
A163307: a(n) = 14*a(n-1) - 44*a(n-2) for n > 1; a(0) = 1, a(1) = 8.
-
A163309: a(n) = 18*a(n-1) - 76*a(n-2) for n > 1; a(0) = 1, a(1) = 10.
-
A163322: The 3rd Hermite Polynomial evaluated at n: H_3(n) = 8*n^3 - 12*n.
-
A163323: The 4th Hermite Polynomial evaluated at n: H_4(n) = 16n^4 - 48n^2 + 12.
-
A163346: a(n) = 10*a(n-1) - 23*a(n-2) for n > 1; a(0) = 1, a(1) = 7.
-
A163348: a(n) = 6*a(n-1) - 7*a(n-2) for n > 1; a(0) = 1, a(1) = 7.
-
A163350: a(n) = 8*a(n-1) - 14*a(n-2) for n > 1; a(0) = 1, a(1) = 6.
-
A163383: a(n) = (n-1)*2^n - 1.
-
A163395: a(n) = (n-th even nonprime)^(n-th even number).
-
A163403: a(n) = 2*a(n-2) for n > 2; a(1) = 1, a(2) = 2.
-
A163417: a(n) = 2^(floor((n-1)/2)) - n*(n-1)/2.
-
A163423: Numbers n with property that n^2 is a sum of three successive cubes.
-
A163444: a(n) = 12*a(n-1) - 34*a(n-2) for n > 1; a(0) = 1, a(1) = 8.
-
A163458: a(n) = 12*a(n-1) - 34*a(n-2) for n > 1; a(0) = 1, a(1) = 7.
-
A163470: a(n) = 8*a(n-1) - 13*a(n-2) for n > 1; a(0) = 3, a(1) = 15.
-
A163471: a(n) = 10*a(n-1) - 22*a(n-2) for n > 1; a(0) = 3, a(1) = 18.
-
A163472: a(n) = 12*a(n-1) - 33*a(n-2) for n > 1; a(0) = 3, a(1) = 21.
-
A163575: Remove all trailing bits equal to (n mod 2) in binary representation of n.
-
A163581: Number of zeros of sin(x) in integer intervals starting with (0,1).
-
A163604: a(n) = ((3+2*sqrt(2))*(4+sqrt(2))^n + (3-2*sqrt(2))*(4-sqrt(2))^n)/2.
-
A163605: a(n) = ((3+2*sqrt(2))*(5+sqrt(2))^n + (3-2*sqrt(2))*(5-sqrt(2))^n)/2.
-
A163606: a(n) = ((3 + 2*sqrt(2))*(3 + sqrt(2))^n + (3 - 2*sqrt(2))*(3 - sqrt(2))^n)/2.
-
A163607: a(n) = ((5 + 2*sqrt(2))*(1 + sqrt(2))^n + (5 - 2*sqrt(2))*(1 - sqrt(2))^n)/2.
-
A163608: a(n) = ((5 + 2*sqrt(2))*(2 + sqrt(2))^n + (5 - 2*sqrt(2))*(2 - sqrt(2))^n)/2.
-
A163609: a(n) = ((5 + 2*sqrt(2))*(3 + sqrt(2))^n + (5 - 2*sqrt(2))*(3 - sqrt(2))^n)/2.
-
A163613: a(n) = ((1 + 3*sqrt(2))*(2 + sqrt(2))^n + (1 - 3*sqrt(2))*(2 - sqrt(2))^n)/2.
-
A163614: a(n) = ((1 + 3*sqrt(2))*(3 + sqrt(2))^n + (1 - 3*sqrt(2))*(3 - sqrt(2))^n)/2.
-
A163615: a(n) = ((1 + 3*sqrt(2))*(4 + sqrt(2))^n + (1 - 3*sqrt(2))*(4 - sqrt(2))^n)/2.
-
A163655: a(n) = n*(2*n^2 + 5*n + 13)/2.
-
A163661: a(n) = n*(2*n^2 + 5*n + 17)/2.
-
A163662: A020988 written in base 2.
-
A163664: a(n) = 10^(2*n) + 10^n.
-
A163673: a(n) = n*(2*n^2 + 5*n + 15)/2.
-
A163675: a(n) = n*(2*n^2 + 5*n + 19)/2.
-
A163683: a(n) = n^2*(2*n + 5).
-
A163695: Number of n X 2 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent.
-
A163704: Number of n X 2 binary arrays with all 1s connected, a path of 1s from left column to lower right corner, and no 1 having more than two 1s adjacent.
-
A163714: Number of n X 2 binary arrays with all 1s connected, a path of 1s from top row to bottom row, and no 1 having more than two 1s adjacent.
-
A163733: Number of n X 2 binary arrays with all 1’s connected, all corners 1, and no 1 having more than two 1’s adjacent.
-
A163756: 14 times triangular numbers.
-
A163758: a(n) = 9*n*(n+1).
-
A163761: a(n) = 10*n*(n+1).
-
A163804: Expansion of (1 - x) * (1 - x^4) / ((1 - x^2) * (1 - x^3)) in powers of x.
-
A163805: Expansion of (1 - x) * (1 - x^6) / ((1 - x^3) * (1 - x^4)) in powers of x.
-
A163806: Expansion of (1 - x^3) * (1 - x^4) / ((1 - x) * (1 - x^6)) in powers of x.
-
A163810: Expansion of (1 - x) * (1 - x^2) * (1 - x^3) / (1 - x^6) in powers of x.
-
A163811: Expansion of (1 - x) * (1 - x^10) / ((1 - x^5) * (1 - x^6)) in powers of x.
-
A163815: a(n) = n*(2*n^2 + 5*n + 3).
-
A163817: Expansion of (1 - x^2) * (1 - x^5) / ((1 - x) * (1 - x^6)) in powers of x.
-
A163818: Expansion of (1 - x) * (1 - x^6) / ((1 - x^2) * (1 - x^5)) in powers of x.
-
A163827: a(n) = 6n^3 + 1, solution z in Diophantine equation x^3 + y^3 = z^3 - 2. It may be considered a Fermat near miss by 2.
-
A163832: a(n) = n*(2*n^2 + 5*n + 1).
-
A163833: a(n) = n*(6*n^2 + 15*n + 5)/2.
-
A163834: a(n) = (4^n + 5)/3.
-
A163839: a(n) = (2^n-1)*4^(2*n-1).
-
A163864: a(n) = 2*a(n-2) for n > 2; a(1) = 1, a(2) = 6.
-
A163868: a(n) = (4^n + 11)/3.
-
A163888: a(n) = 2*a(n-2) for n > 2; a(1) = 5, a(2) = 4.
-
A163978: a(n) = 2*a(n-2) for n > 2; a(1) = 3, a(2) = 4.
-
A163979: a(n) = n*(n-1) + A144437(n+2).
-
A163980: a(n) = 2*n + (-1)^n.