Summary of block A014
Sequences in block A014
Section titled “Sequences in block A014”-
A014017: Inverse of 8th cyclotomic polynomial.
-
A014019: Inverse of 10th cyclotomic polynomial.
-
A014020: Inverse of 11th cyclotomic polynomial.
-
A014021: Inverse of 12th cyclotomic polynomial.
-
A014025: Expansion of the inverse of the 16th cyclotomic polynomial.
-
A014027: Inverse of 18th cyclotomic polynomial.
-
A014050: a(n) = (n^2+1)^n.
-
A014105: Second hexagonal numbers: a(n) = n*(2*n + 1).
-
A014106: a(n) = n*(2*n + 3).
-
A014107: a(n) = n*(2*n-3).
-
A014112: a(n) = n*(n-1) + (n-2)*(n-3) + … + 1*0 + 1 for n odd; otherwise, a(n) = n*(n-1) + (n-2)*(n-3) + … + 2*1.
-
A014113: a(n) = a(n-1) + 2*a(n-2) with a(0)=0, a(1)=2.
-
A014117: Numbers n such that m^(n+1) == m (mod n) holds for all m.
-
A014125: Bisection of A001400.
-
A014130: ((n+3)!/6)*product( 2*k+1, k=0..n).
-
A014131: a(n) = 2*a(n-1) if n odd else 2*a(n-1) + 6.
-
A014132: Complement of triangular numbers (A000217); also array T(n,k) = ((n+k)^2 + n-k)/2, n, k > 0, read by antidiagonals.
-
A014136: Not of form x^3 + 2y^3 + 3z^3.
-
A014138: Partial sums of (Catalan numbers starting 1, 2, 5, …).
-
A014144: Apply partial sum operator twice to factorials.
-
A014145: Partial sums of A007489.
-
A014205: (1/12)*(n+5)*(n+1)*n^2.
-
A014206: a(n) = n^2 + n + 2.
-
A014209: a(n) = n^2 + 3*n - 1.
-
A014217: a(n) = floor(phi^n), where phi = (1+sqrt(5))/2 is the golden ratio.
-
A014222: a(0) = 0; thereafter a(n+1) = 3^a(n).
-
A014225: Number of initial pieces needed to reach level n in the Solitaire Army game.
-
A014236: Expansion of g.f.: 2*x*(1-x)/((1-2*x)*(1-2*x^2)).
-
A014245: a(n) = (n-th term of Beatty sequence for (3+sqrt(3))/2) - (n-th term of Beatty sequence for sqrt(3)).
-
A014253: a(n) = b(n)^2, where b(n) = b(n-1)^2 + b(n-2)^2 (A000283).
-
A014255: Expansion of (1+2*x+3*x^2)/((1-x)*(1-x^2)^2).
-
A014283: a(n) = Fibonacci(n) - n^2.
-
A014286: a(n) = Sum_{j=0..n} j*Fibonacci(j).
-
A014288: a(n) = floor(Sum_{k=0..n} k!/2), or floor( A003422(n+1)/2 ).
-
A014290: Submitted to the OEIS as “Seen on a billboard in England, definition unknown”.
-
A014293: a(n) = n^(n+1) - n + 1.
-
A014297: a(n) = n! * C(n+2, 2) * 2^(n+1).
-
A014298: a(n) = 2^n * (3n)! / (2n+1)!.
-
A014318: Convolution of Catalan numbers and powers of 2.
-
A014334: Exponential convolution of Fibonacci numbers with themselves.
-
A014335: Exponential convolution of Fibonacci numbers with themselves (divided by 2).
-
A014390: Final 2 digits of 7^n.
-
A014391: Final digit of 8^n.
-
A014392: Final 2 digits of 8^n.
-
A014393: Final 2 digits of 9^n.
-
A014437: Odd Fibonacci numbers.
-
A014445: Even Fibonacci numbers; or, Fibonacci(3*n).
-
A014447: Odd Lucas numbers.
-
A014448: Even Lucas numbers: L(3n).
-
A014477: Expansion of (1 + 2*x)/(1 - 2*x)^3.
-
A014479: Exponential generating function = (1+2*x)/(1-2*x)^3.
-
A014480: Expansion of g.f. (1+2*x)/(1-2*x)^2.
-
A014481: a(n) = 2^n*n!*(2*n+1).
-
A014483: Expansion of (1+2*x) / (1-2*x)^4.
-
A014484: Expansion of (1+2x)/(1-2x)^4 (E.g.f.).
-
A014493: Odd triangular numbers.
-
A014494: Even triangular numbers.
-
A014508: a(n) = floor( n! / e ).
-
A014546: Primes in Sylvester’s sequence A000058.
-
A014551: Jacobsthal-Lucas numbers.
-
A014556: Euler’s “Lucky” numbers: n such that m^2-m+n is prime for m=0..n-1.
-
A014566: Sierpiński numbers of the first kind: n^n + 1.
-
A014577: The regular paper-folding sequence (or dragon curve sequence). Alphabet {1,0}.
-
A014591: a(n) = floor(n^2/12 + 5/4).
-
A014593: Stairs of ideals of gradient type in the theory of singularities.
-
A014601: Numbers congruent to 0 or 3 mod 4.
-
A014606: a(n) = (3n)!/(6^n).
-
A014608: a(n) = (4n)!/(24^n).
-
A014616: a(n) = solution to the postage stamp problem with 2 denominations and n stamps.
-
A014626: Number of intersection points of diagonals of an n-gon in general position, plus number of vertices.
-
A014628: Number of segments (and sides) created by diagonals of an n-gon in general position.
-
A014629: Number of segments created by diagonals of n-gon.
-
A014632: Odd pentagonal numbers.
-
A014633: Even pentagonal numbers.
-
A014634: a(n) = (2*n+1)*(4*n+1).
-
A014635: a(n) = 2*n*(4*n - 1).
-
A014637: Odd heptagonal numbers (A000566).
-
A014641: Odd octagonal numbers: (2n+1)*(6n+1).
-
A014642: Even octagonal numbers: a(n) = 4*n*(3*n-1).
-
A014681: Fix 0; exchange even and odd numbers.
-
A014682: The Collatz or 3x+1 function: a(n) = n/2 if n is even, otherwise (3n+1)/2.
-
A014683: In the sequence of positive integers add 1 to each prime number.
-
A014684: In the sequence of positive integers subtract 1 from each prime number.
-
A014695: Poincaré series [or Poincare series] (or Molien series) for mod 2 cohomology of Q_8.
-
A014707: a(4n) = 0, a(4n+2) = 1, a(2n+1) = a(n).
-
A014709: The regular paper-folding (or dragon curve) sequence. Alphabet {1,2}.
-
A014710: The regular paper-folding (or dragon curve) sequence. Alphabet {2,1}.
-
A014717: a(n) = (F(n+1) + L(n))^2 where F(n) are the Fibonacci numbers (A000045) and L(n) are the Lucas numbers (A000032).
-
A014729: Squares of even Fibonacci numbers.
-
A014731: Squares of even Lucas numbers.
-
A014739: Expansion of (1+x^2)/(1-2*x+x^3).
-
A014742: Expansion of (1+x^2)/(1 - 2*x - 2*x^2 + x^3).
-
A014771: Squares of odd hexagonal numbers.
-
A014772: Squares of even hexagonal numbers.
-
A014793: Squares of odd octagonal numbers.
-
A014794: Squares of even octagonal numbers.
-
A014799: Squares of odd pentagonal pyramidal numbers.
-
A014820: a(n) = (1/3)*(n^2 + 2*n + 3)*(n+1)^2.
-
A014824: a(0) = 0; for n>0, a(n) = 10*a(n-1) + n.
-
A014825: a(n) = 4*a(n-1) + n with n > 1, a(1)=1.
-
A014827: a(1)=1, a(n) = 5*a(n-1) + n.
-
A014829: a(1)=1, a(n) = 6*a(n-1) + n.
-
A014830: a(1)=1; for n > 1, a(n) = 7*a(n-1) + n.
-
A014831: a(1)=1; for n>1, a(n) = 8*a(n-1) + n.
-
A014832: a(1)=1; for n>1, a(n) = 9*a(n-1) + n.
-
A014833: a(n) = 2^n - n*(n+1)/2.
-
A014844: a(n) = 2^n - n*(n-1)/2.
-
A014846: 2^(n-1) - n*(n+1)/2.
-
A014848: a(n) = n^2 - floor( n/2 ).
-
A014881: a(1)=1, a(n) = 11*a(n-1) + n.
-
A014882: a(1) = 1, a(n) = 12*a(n-1) + n.
-
A014896: a(1) = 1, a(n) = 13*a(n-1) + n.
-
A014897: a(1)=1, a(n) = 14*a(n-1) + n.
-
A014898: a(1)=1, a(n) = 15*a(n-1) + n.
-
A014899: a(n) = (16^(n+1) - 15*n - 16)/225.
-
A014900: a(1)=1, a(n) = 17*a(n-1) + n.
-
A014901: a(1)=1, a(n) = 18*a(n-1) + n.
-
A014903: a(1)=1, a(n) = 19*a(n-1) + n.
-
A014904: a(1)=1, a(n) = 20*a(n-1) + n.
-
A014905: a(1)=1, a(n) = 21*a(n-1) + n.
-
A014907: a(1)=1, a(n) = 22*a(n-1) + n.
-
A014909: a(1)=1, a(n) = 23*a(n-1) + n.
-
A014913: a(1)=1, a(n) = 24*a(n-1) + n.
-
A014914: a(1)=1, a(n) = 25*a(n-1) + n.
-
A014915: a(1)=1, a(n) = n*3^(n-1) + a(n-1).
-
A014916: a(1)=1, a(n) = n*4^(n-1) + a(n-1).
-
A014917: a(1)=1, a(n) = n*5^(n-1) + a(n-1).
-
A014918: a(1)=1, a(n) = n*6^(n-1) + a(n-1).
-
A014920: a(1)=1, a(n) = n*7^(n-1) + a(n-1).
-
A014921: a(1)=1, a(n) = n*8^(n-1) + a(n-1).
-
A014923: a(1) = 1, a(n) = n*9^(n-1) + a(n-1).
-
A014925: Number of zeros in numbers 1 to 111…1 (n+1 digits).
-
A014926: a(1)=1, a(n) = n*11^(n-1) + a(n-1).
-
A014927: a(1)=1, a(n) = n*12^(n-1) + a(n-1).
-
A014928: a(1)=1, a(n) = n*13^(n-1) + a(n-1).
-
A014929: a(1)=1, a(n) = n*14^(n-1) + a(n-1).
-
A014930: a(1)=1, a(n) = n*15^(n-1) + a(n-1).
-
A014934: a(1)=1, a(n)=n*17^(n-1)+a(n-1).
-
A014935: a(1)=1, a(n) = n*18^(n-1) + a(n-1).
-
A014936: a(1)=1, a(n) = n*19^(n-1) + a(n-1).
-
A014937: a(1)=1, a(n) = n*20^(n-1) + a(n-1).
-
A014938: a(1)=1, a(n) = n*21^(n-1) + a(n-1).
-
A014940: a(1)=1, a(n) = n*22^(n-1) + a(n-1).
-
A014942: a(n) = (1 + 24^n*(23*n - 1))/529.
-
A014943: a(1)=1, a(n) = n*25^(n-1) + a(n-1).
-
A014964: a(n) = lcm(n, 2^(n-1)).
-
A014973: a(n) = n / gcd(n, (n-1)!).
-
A014980: a(n+1) = floor(a(n)/2) * ceiling(a(n)/2), a(0) = 5.
-
A014983: a(n) = (1 - (-3)^n)/4.
-
A014985: a(n) = (1 - (-4)^n)/5.
-
A014986: a(n) = (1 - (-5)^n)/6.
-
A014987: a(n) = (1 - (-6)^n)/7.
-
A014989: a(n) = (1 - (-7)^n)/8.
-
A014990: a(n) = (1 - (-8)^n)/9.
-
A014991: a(n) = (1 - (-9)^n)/10.
-
A014992: a(n) = (1 - (-10)^n)/11.
-
A014993: a(n) = (1 - (-11)^n)/12.
-
A014994: a(n) = (1 - (-12)^n)/13.