Summary of block A084
Sequences in block A084
Section titled “Sequences in block A084”-
A084056: a(n) = -a(n-1) + a(n-2) + a(n-3), with a(0)=0, a(1)=1, a(2)=-3.
-
A084057: a(n) = 2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=1.
-
A084058: a(n) = 2*a(n-1) + 7*a(n-2) for n>1, a(0)=1, a(1)=1.
-
A084059: a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=1, a(1)=2.
-
A084060: a(n) = 1/2 + (1-6*n)*(-1)^n/2.
-
A084068: a(1) = 1, a(2) = 2; a(2*k) = 2*a(2*k-1) - a(2*k-2), a(2*k+1) = 4*a(2*k) - a(2*k-1).
-
A084070: a(n) = 38*a(n-1) - a(n-2), with a(0)=0, a(1)=6.
-
A084099: Expansion of (1+x)^2/(1+x^2).
-
A084100: Expansion of (1+x-x^2-x^3)/(1+x^2).
-
A084101: Expansion of (1+x)^2/((1-x)*(1+x^2)).
-
A084103: Expansion of (1+x)^3/(1+x^3).
-
A084104: A period 6 sequence.
-
A084120: a(n) = 6*a(n-1) - 3*a(n-2), a(0)=1, a(1)=3.
-
A084128: a(n) = 4*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.
-
A084130: a(n) = 8*a(n-1) - 8*a(n-2), a(0)=1, a(1)=4.
-
A084132: a(n) = 4*a(n-1) + 6*a(n-2), a(0)=1, a(1)=2.
-
A084133: Duplicate of A005667.
-
A084134: a(n) = 8*a(n-1) - 6*a(n-2), a(0) = 1, a(1) = 4.
-
A084136: Binomial transform of cosh(sqrt(2)*x)^2.
-
A084137: Binomial transform of A084136.
-
A084150: A Pell related sequence.
-
A084152: Exponential self-convolution of Jacobsthal numbers (divided by 2).
-
A084153: Binomial transform of a Jacobsthal convolution.
-
A084154: Binomial transform of sinh(x)*cosh(sqrt(2)*x).
-
A084158: a(n) = A000129(n) * A000129(n+1)/2.
-
A084159: Pell oblongs.
-
A084169: A Pell Jacobsthal product.
-
A084170: a(n) = (5*2^n + (-1)^n - 3)/3.
-
A084171: Binomial transform of generalized Jacobsthal numbers A084170.
-
A084172: a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).
-
A084173: a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).
-
A084174: a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).
-
A084175: Jacobsthal oblong numbers.
-
A084178: Inverse binomial transform of Fibonacci oblongs.
-
A084179: Expansion of the g.f. x/((1+2x)(1-x-x^2)).
-
A084180: Duplicate of A020988.
-
A084182: a(n) = 3^n + (-1)^n - [1/(n+1)], where [] represents the floor function.
-
A084183: Jacobsthal reverse-pair sequence.
-
A084184: Partial sums of a Jacobsthal related sequence.
-
A084213: Binomial transform of A081250.
-
A084214: Inverse binomial transform of a math magic problem.
-
A084215: Expansion of g.f.: (1+x^2)/(1-2*x).
-
A084221: a(n+2) = 4*a(n), with a(0)=1, a(1)=3.
-
A084222: a(n) = -2*a(n-1) + 3*a(n-2), with a(0)=1, a(1)=2.
-
A084231: Numbers k such that the root-mean-square value of 1, 2, …, k, i.e., sqrt((1/k)*Sum_{j=1..k} j^2), is an integer.
-
A084232: RMS values associated with A084231.
-
A084240: a(n) = -5*a(n-1) - 4*a(n-2), a(0)=1, a(1)=0.
-
A084241: a(n) = -5*a(n-1)-4*a(n-2) with n>1, a(0)=0, a(1)=1.
-
A084244: a(0)=1, a(1)=5, a(n) = -3*a(n-1), n>1.
-
A084247: a(n) = -a(n-1) + 2*a(n-2), a(0)=1, a(1)=2.
-
A084253: a(n) is the denominator of the coefficient of z^(2n-1) in the Maclaurin expansion of Sqrt[Pi]Erfi[z].
-
A084263: a(n) = (-1)^n/2+(n^2+n+1)/2.
-
A084264: Binomial transform of A084263.
-
A084265: a(n) = (n^2 + 3*n + 1 + (-1)^n) / 2.
-
A084266: Binomial transform of A084265.
-
A084326: a(0)=0, a(1)=1; for n>1, a(n) = 6*a(n-1)-4*a(n-2).
-
A084327: Duplicate of A057085.
-
A084328: a(0)=0, a(1)=1; a(n) = 13*a(n-1) - 11*a(n-2).
-
A084329: a(0)=0, a(1)=1, a(n)=20a(n-1)-20a(n-2).
-
A084330: a(0)=0, a(1)=1, a(n) = 31*a(n-1) - 29*a(n-2).
-
A084359: a(n) = number of partitions of n into pair of parts n=p+q, p>=q>=1, with p-q equal to a square >= 0.
-
A084367: a(n) = n*(2*n+1)^2.
-
A084377: a(n) = n^3 + 7.
-
A084378: a(n) = n^3 + 3.
-
A084379: a(n) = n^3 + 17.
-
A084380: a(n) = n^3 + 2.
-
A084381: a(n) = n^3 + 5.
-
A084382: a(n) = n^3 + 6.
-
A084431: Expansion of g.f. (1 + 6*x + 5*x^2)/((1-2*x)*(1+2*x)).
-
A084443: Primes that can be written in more than one way as 1+p+p^k, p prime and k>0.
-
A084508: Partial sums of A084509. Positions of ones in the first differences of A084506.
-
A084509: Number of ground-state 3-ball juggling sequences of period n.
-
A084537: Duplicate of A002061.
-
A084556: n occurs n! times.
-
A084558: a(0) = 0; for n >= 1: a(n) = largest m such that n >= m!.
-
A084567: Binomial transform of (1,-1,4,-16,64,-256,1024,…) = (3*0^n-(-4)^n)/4.
-
A084568: a(0)=1, a(1)=5, a(n+2)=4a(n), n>0.
-
A084569: Partial sums of A084570.
-
A084570: Partial sums of A084263.
-
A084594: a(n) = Sum_{r=0..2^(n-1)} Binomial(2^n,2r)*3^r.
-
A084595: For n > 0: a(n) = Sum_{r=0..2^(n-1)-1} binomial(2^n, 2r+1)*3^r.
-
A084624: a(n) = floor(C(n+5,5)/C(n+2,2)).
-
A084626: a(n) = floor(C(n+6,6)/C(n+2,2)).
-
A084630: a(n) = floor(C(n+7,7)/C(n+5,5)).
-
A084631: a(n) = floor(C(n+8,8)/C(n+2,2)).
-
A084633: Inverse binomial transform of repeated odd numbers.
-
A084634: Binomial transform of 1, 1, 1, 2, 2, 2, 2, 2, …
-
A084635: Binomial transform of 1,0,1,0,1,1,1,…
-
A084639: Expansion of x*(1+2*x)/((1+x)*(1-x)*(1-2*x)).
-
A084640: Generalized Jacobsthal numbers.
-
A084642: A Jacobsthal ratio.
-
A084672: Expansion of g.f.: (1+x^2+2*x^4)/((1-x^3)*(1-x)^2).
-
A084684: Degrees of certain maps (see Comments and Formulas for more precise definitions).
-
A084688: Nonnegative integers n such that 2^n uses only distinct decimal digits.
-
A084689: 3^n uses only distinct decimal digits.
-
A084690: 4^n uses only distinct decimal digits.
-
A084703: Squares k such that 2*k+1 is also a square.
-
A084743: Smallest prime of the form n^k + k, or 0 if no such prime exists.
-
A084756: For n, k > 0, let T(n, k) be given by T(n, 1) = n and T(n, k+1) = k*T(n, k) + 1. Then a(n) = T(n, n).
-
A084764: a(n) = 2*a(n-1)^2 - 1, a(0)=1, a(1)=4.
-
A084765: a(n) = 2*a(n-1)^2 - 1, a(0)=1, a(1)=5.
-
A084811: Duplicate of A051856.
-
A084825: Maximum number of spheres of diameter one that can be packed in a cube of edge length n.
-
A084828: Maximum number of spheres of radius one that can be packed in a sphere of radius n.
-
A084842: Number of rooted trees with n nodes with a height of 2 and with at least 1 node at height 1 has degree > 2.
-
A084844: Denominators of the continued fraction n + 1/(n + 1/…) [n times].
-
A084849: a(n) = 1 + n + 2*n^2.
-
A084850: 2^(n-1)*(n^2+2n+2).
-
A084851: Binomial transform of binomial(n+2,2).
-
A084853: Numbers k such that k^(k+1) + (k+1)^k + k(k+1) is prime.
-
A084857: Inverse binomial transform of n^2*3^(n-1).
-
A084858: Binomial transform of A001651.
-
A084859: Binomial transform of Cullen numbers A002064.
-
A084860: Expansion of (1 - 2x + 2x^2 - x^3)/(1 - 2x)^2.
-
A084869: Number of 2-multiantichains of an n-set.
-
A084874: Number of (k,m,n)-antichains of multisets with k=3 and m=2.
-
A084879: Number of (k,m,n)-multiantichains of multisets with k=3 and m=2.
-
A084899: Binomial transform of heptagonal numbers A000566.
-
A084902: a(n) = 5^(n-1)*n*(n+1)/2.
-
A084915: a(n) = (n!)^2*n.
-
A084939: Pentagorials: n-th polygorial for k=5.
-
A084941: Octagorials: n-th polygorial for k=8.
-
A084943: Decagorials: n-th polygorial for k=10.
-
A084946: Duplicate of A047055.
-
A084947: a(n) = Product_{i=0..n-1} (7*i+2).
-
A084948: a(n) = Product_{i=0..n-1} (8*i+2).
-
A084949: a(n) = Product_{i=0..n-1} (9*i+2).
-
A084962: Iterations of the Fibonacci sequence starting at 6.
-
A084963: a(0) = 7, a(n+1) = Fibonacci(a(n)).
-
A084964: Follow n+2 by n. Also solution of a(n+2)=a(n)+1, a(0)=2, a(1)=0.
-
A084967: Multiples of 5 whose GCD with 6 is 1.
-
A084990: a(n) = n*(n^2+3*n-1)/3.