Summary of block A082
Sequences in block A082
Section titled “Sequences in block A082”-
A082028: Expansion of exp(x)*(1+x)/(1-x)^2.
-
A082030: Expansion of e.g.f. exp(x)/(1-x)^3.
-
A082032: Expansion of e.g.f.: exp(2*x)/(1-2*x).
-
A082033: a(n) = (3n+1)*n!.
-
A082034: a(n) = (4*n + 1)*n!.
-
A082035: a(n) = (4n^2+2n+1) * n!.
-
A082036: a(n) = (9*n^2+3*n+1) * n!.
-
A082040: a(n) = 9*n^2 + 3*n + 1.
-
A082041: a(n) = 16*n^2 + 4*n + 1.
-
A082042: a(n) = (n^2+1)*n!.
-
A082044: Main diagonal of A082043: a(n) = n^4 + 2*n^2 + 1.
-
A082101: Primes of form 2^k + 3^k.
-
A082106: Main diagonal of number array A082105.
-
A082108: a(n) = 4*n^2 + 6*n + 1.
-
A082109: Third row of number array A082105.
-
A082111: a(n) = n^2 + 5*n + 1.
-
A082112: a(n) = 4*n^2 + 10*n + 1.
-
A082113: a(n) = n^4 + 5*n^2 + 1.
-
A082115: Fibonacci sequence (mod 3).
-
A082116: Fibonacci sequence (mod 5).
-
A082117: Fibonacci sequence (mod 6).
-
A082118: Duplicate of A079344.
-
A082133: Expansion of e.g.f. x*exp(2*x)*cosh(x).
-
A082134: Expansion of e.g.f. x*exp(3*x)*cosh(x).
-
A082135: Expansion of e.g.f. x*exp(4*x)*cosh(x).
-
A082136: Expansion of e.g.f. x*exp(5*x)*cosh(x).
-
A082138: A transform of C(n,3).
-
A082139: A transform of binomial(n,5).
-
A082140: A transform of binomial(n,6).
-
A082141: A transform of C(n,7).
-
A082142: Duplicate of A069723.
-
A082143: First subdiagonal of number array A082137.
-
A082144: A subdiagonal of number array A082137.
-
A082145: A subdiagonal of number array A082137.
-
A082149: A transform of C(n,2).
-
A082204: Begin with a 1, then place the smallest (as far as possible distinct) digits, such that, beginning from the n-th term, n terms form a palindrome.
-
A082206: Digit sum of A082205(n).
-
A082285: a(n) = 16*n + 13.
-
A082286: a(n) = 18*n + 10.
-
A082291: Expansion of x(2 + 5x - x^2)/((1 - x)(1 - 6x + x^2)).
-
A082296: Solutions to 13^x+17^x == 19 mod 23.
-
A082306: Expansion of e.g.f. (1+x)*exp(2*x)*cosh(x).
-
A082310: Duplicate of A015565.
-
A082311: A Jacobsthal sequence trisection.
-
A082365: A Jacobsthal number sequence.
-
A082369: Numbers congruent to 13 mod 30.
-
A082383: a(0)=1, a(n)=2^n+n-2*a(n-1).
-
A082405: a(n) = 34*a(n-1) - a(n-2); a(0)=0, a(1)=6.
-
A082410: a(1)=0. Thereafter, the sequence is constructed using the rule: for any k >= 0, if a(1), a(2), …, a(2^k+1) are known, the next 2^k terms are given as follows: a(2^k+1+i) = 1 - a(2^k+1-i) for 1 <= i <= 2^k.
-
A082412: a(n) = (2*8^n + 2^n)/3.
-
A082413: a(n) = (2*9^n + 3^n)/3.
-
A082414: a(n) = (2*10^n + 4^n)/3.
-
A082416: Parity of A073941(n).
-
A082426: a(n) = floor(n*n!/2 + 1).
-
A082429: a(n) is the cardinality of the smallest subset S1 of S={1,2,3,…,n} such that every element of S is either in S1 or is the sum of two elements of S1.
-
A082446: a(0)=0, a(1)=1, a(2)=0; thereafter, if k>=0 and a block of the first 3*2^k terms is known, then a(3*2^k+i)=1-a(i) for 0<=i<3*2^k.
-
A082450: a(n) = 5*(n^2-n+2)/2.
-
A082463: Numbers k such that A072181(k) + 1 is prime.
-
A082464: Numbers k such that A072181(k) - 1 is prime.
-
A082471: a(1)=1, a(n) = Sum_{k=1..n-1} Fibonacci(k)*a(k).
-
A082472: a(1) = 1, a(n) = Sum_{k=1..n-1} a(k)*2^k.
-
A082480: a(n) = Product_{k=1..n} (F(k)+1) where F(k) denotes the k-th Fibonacci number.
-
A082482: a(n) = floor of (2^n-1)/n.
-
A082491: a(n) = n! * d(n), where n! = factorial numbers (A000142), d(n) = subfactorial numbers (A000166).
-
A082493: a(n) = n*ceiling(2^n/n) - 2^n.
-
A082494: a(n) = n - (2^n (mod n)).
-
A082495: a(n) = (2^n - 1) mod n.
-
A082505: a(n) = sum of (n-1)-th row terms of triangle A134059.
-
A082511: a(n) = 3^n mod 2n.
-
A082541: a(n) = (7*3^n - 4*0^n)/3.
-
A082543: Take a string of n x’s and insert n-1 ^‘s and n-1 pairs of parentheses in all possible ways. Sequence gives number of distinct integer values when x=sqrt(2).
-
A082562: a(n) = number of values of m such that m can be expressed as the sum of distinct odd numbers with largest odd number in the sum = 2n+1.
-
A082569: a(1)=2; a(n)=ceiling(n*(a(n-1)-1/a(n-1))).
-
A082570: a(1)=1, a(n)=ceiling(n*(a(n-1)+1/a(n-1))).
-
A082574: a(1)=1, a(n) = ceiling(r(3)*a(n-1)) where r(3) = (1/2)*(3 + sqrt(13)) is the positive root of X^2 = 3*X + 1.
-
A082585: a(1)=1, a(n) = ceiling(r(5)*a(n-1)) where r(5) = (1/2)*(5 + sqrt(29)) is the positive root of X^2 = 5*X + 1.
-
A082587: G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).
-
A082590: Expansion of 1/((1 - 2*x)*sqrt(1 - 4*x)).
-
A082605: Using Euler’s 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.
-
A082630: Limit of the sequence obtained from S(0) = (1,1) and, for n > 0, S(n) = I(S(n-1)), where I consists of inserting, for i = 1, 2, 3…, the term a(i) + a(i+1) between any two terms for which 7*a(i+1) <= 11*a(i).
-
A082639: Numbers k such that 2*k*(k+2) is a square.
-
A082642: Expansion of Molien series for 5-dimensional representation of dihedral group of order 10.
-
A082643: a(n) = ceiling(n*(n+1/2)/2).
-
A082644: a(n) = floor(n*(n-1/2)/2).
-
A082645: a(n) = floor((2*n^2 + n - 4)/4).
-
A082651: Positive integer values of n such that 5n^2+11 is a square.
-
A082667: a(n) = floor(2n/3) * ceiling(2n/3) / 2.
-
A082685: (2*5^n + 2^n)/3.
-
A082732: a(1) = 1, a(2) = 3, a(n) = LCM of all the previous terms + 1.
-
A082752: Duplicate of A023758.
-
A082753: Duplicate of A000337.
-
A082761: Trinomial transform of the Fibonacci numbers (A000045).
-
A082762: Trinomial transform of Lucas numbers (A000032).
-
A082764: Trinomial transform of the Pell numbers (A000129).
-
A082784: Characteristic function of multiples of 7.
-
A082787: a(n) = (2/3)*(2*n-1)!*binomial(3*n,2*n).
-
A082814: Values of m associated with A082813.
-
A082840: a(n) = 4*a(n-1) - a(n-2) + 3, with a(0) = -1, a(1) = 1.
-
A082841: a(n) = 4*a(n-1) - a(n-2) for n>1, a(0)=3, a(1)=9.
-
A082845: Partial sums of A082844.
-
A082848: Duplicate of A078588.
-
A082871: First component x of pairs (x,y) where x <= y and x!+y! is a square, sorted on x.
-
A082894: a(n) is the closest number to 2^n which is divisible by n.
-
A082946: Duplicate of A082945.
-
A082960: Number of inequivalent optimal Hermitian self-dual codes of length 2n over GF(4).
-
A082973: Fibonacci numbers which are of the form Sum{i=1..k} prime(i) for some k.
-
A082986: Largest x such that 1/x + 1/y + 1/z = 1/n.
-
A082988: a(n) = Sum_{k=0..n} 4^k*F(k) where F(k) is the k-th Fibonacci number.