Summary of block A215
Sequences in block A215
Section titled “Sequences in block A215”-
A215004: a(0) = a(1) = 1; for n>1, a(n) = a(n-1) + a(n-2) + floor(n/2).
-
A215005: a(n) = a(n-2) + a(n-1) + floor(n/2) + 1 for n > 1 and a(0)=0, a(1)=1.
-
A215006: a(0)=0, a(n+1) is the least k>a(n) such that k+a(n)+n+1 is a Fibonacci number.
-
A215036: 2 followed by “1,0” repeated.
-
A215039: a(n) = Fibonacci(2*n)^3, n>=0.
-
A215040: a(n) = F(2*n+1)^3, n>=0, with F = A000045 (Fibonacci).
-
A215044: a(n) = F(2*n)^5 with F=A000045 (Fibonacci numbers).
-
A215045: a(n) = F(2*n+1)^5 with n >= 0, F=A000045 (Fibonacci numbers).
-
A215098: a(0)=0, a(1)=1, a(n) = n*(n-1) - a(n-2).
-
A215137: a(n) = 17*n + 1.
-
A215144: a(n) = 19*n + 1.
-
A215145: a(n) = 20*n + 1.
-
A215146: a(n) = 21*n + 1.
-
A215147: For n odd, a(n) = 1^2+2^2+3^2+…+n^2; for n even, a(n) = (1^2+2^2+3^2+…+n^2)+1.
-
A215148: a(n) = 23*n + 1.
-
A215149: a(n) = n * (1 + 2^(n-1)).
-
A215159: a(n) = floor(n^n / (n+1)).
-
A215176: Number of nXnXn triangular 0..2 arrays with every horizontal row nondecreasing, first elements of rows nonincreasing, last elements of rows nondecreasing, and every row having the same average value.
-
A215203: a(0) = 0, a(n) = a(n - 1)*2^(n + 1) + 2^n - 1. That is, add one 0 and n 1’s to the binary representation of previous term.
-
A215247: A Beatty sequence: a(n) = floor((n-1/2)*(2 + 2*sqrt(2))).
-
A215270: a(n) = a(n-1)*a(n-2) with a(0)=1, a(1)=6.
-
A215271: a(n) = a(n-1)*a(n-2) with a(0)=1, a(1)=8.
-
A215272: a(n) = a(n-1)*a(n-2) with a(0)=1, a(1)=9.
-
A215409: The Goodstein sequence G_n(3).
-
A215415: a(2*n) = n, a(4*n+1) = 2*n-1, a(4*n+3) = 2*n+3.
-
A215449: Duplicate of A259967.
-
A215456: a(n)=(4n-1)!! modulo 2n, n=1,2,…
-
A215458: a(n) = 4*a(n-1) - 7*a(n-2) + 8*a(n-3) - 4*a(n-4) starting 0, 1, 4, 7.
-
A215476: Minimum number of comparisons needed to find the median of n elements.
-
A215495: a(4*n) = a(4*n+2) = a(2*n+1) = 2*n + 1.
-
A215573: a(n) = n*(n+1)*(2n+1)/6 modulo n.
-
A215580: Partial sums of A215602.
-
A215602: a(n) = L(n)*L(n+1), where L = A000032 (Lucas numbers).
-
A215604: a(0)=0, a(n) = (n + a(floor(n/2))) mod 3.
-
A215646: n * (11*n^2 + 6*n + 1) / 6.
-
A215658: Primes p such that the smallest positive integer k for which p# + k is square satisfies p# + k = k^2, where p# = 2*3*5*7*11*…*p is a primorial.
-
A215687: Number of solid standard Young tableaux of shape [[2*n,2],[2]].
-
A215701: Number of primes of the form 1 + b^2048 for 1 < b < 10^n.
-
A215702: Number of primes of the form 1 + b^4096 for 1 < b < 10^n.
-
A215747: a(n) = (-2)^n mod n.
-
A215781: a(n) = ceiling(n*(sqrt(3)-1)).
-
A215795: Numbers n such that 2^n-1 is a triangular number (A000217).
-
A215797: Numbers k such that k*(k+1)/2 + 1 is a power of 2.
-
A215851: Number of simple labeled graphs on n nodes with exactly 1 connected component that is a tree or a cycle.
-
A215862: Number of simple labeled graphs on n+2 nodes with exactly n connected components that are trees or cycles.
-
A215928: a(n) = 2*a(n-1) + a(n-2) for n > 2, a(0) = a(1) = 1, a(2) = 2.
-
A215931: Product of Fibonacci and Catalan numbers: a(n) = A000045(2*n+2)*A000108(n).
-
A215936: a(n) = -2*a(n-1) + a(n-2) for n > 2, with a(0) = a(1) = 1, a(2) = 0.
-
A215969: Number of primes of the form 1 + b^32768 for 1 < b < 10^n.