Summary of block A020
Sequences in block A020
Section titled “Sequences in block A020”-
A020043: a(n) = round(Gamma(n+2/3)/Gamma(2/3)).
-
A020045: Nearest integer to Gamma(n + 1/2)/Gamma(1/2).
-
A020046: a(n) = floor(Gamma(n+11/12)/Gamma(11/12)).
-
A020080: a(n) = floor( Gamma(n + 5/6)/Gamma(5/6) ).
-
A020082: a(n) = floor( Gamma(n + 4/5)/Gamma(4/5) ).
-
A020086: a(n) = floor( Gamma(n + 3/4)/Gamma(3/4) ).
-
A020087: a(n) = floor( Gamma(n + 1/4)/Gamma(1/4) ).
-
A020088: a(n) = floor(Gamma(n + 2/3)/Gamma(2/3)).
-
A020089: Integer part of Gamma(n + 1/3)/Gamma(1/3).
-
A020090: Integer part of Gamma(n+1/2)/Gamma(1/2).
-
A020133: Ceiling of GAMMA(n+2/3)/GAMMA(2/3).
-
A020135: Ceiling of Gamma(n+1/2)/Gamma(1/2).
-
A020329: Consider integers z such that C(z,4) = C(x,4) + C(y,4), x >= y >= 4, is solvable. Sequence gives values of z.
-
A020330: Numbers whose base-2 representation is the juxtaposition of two identical strings.
-
A020490: Numbers k such that phi(k) <= sigma_0(k).
-
A020514: a(n) = 1^n + 2^n + 4^n + 8^n + 16^n.
-
A020515: a(n) = 4^n - 2^n + 1.
-
A020516: Sum of n-th powers of divisors of 64.
-
A020517: 9th cyclotomic polynomial evaluated at powers of 2.
-
A020518: 10th cyclotomic polynomial evaluated at powers of 2.
-
A020520: 12th cyclotomic polynomial evaluated at powers of 2.
-
A020522: a(n) = 4^n - 2^n.
-
A020524: a(n) = 4th Euler polynomial evaluated at 2^n.
-
A020527: 2nd Bernoulli polynomial evaluated at powers of 2 (multiplied by 6).
-
A020528: 3rd Bernoulli polynomial evaluated at powers of 2 (multiplied by 6).
-
A020530: a(n) = 8^n + 2^(n+1).
-
A020531: a(n) = 5th Fibonacci polynomial evaluated at 2^n.
-
A020532: a(n) = 6th Fibonacci polynomial evaluated at 2^n.
-
A020537: a(n) = 4*8^n - 3*2^n.
-
A020538: a(n) = 4th Chebyshev polynomial (first kind) evaluated at 2^n.
-
A020540: a(n) = 8^(n+1) - 2^(n+2).
-
A020541: a(n) = 4th Chebyshev polynomial (second kind) evaluated at 2^n.
-
A020542: a(n) = 5th Chebyshev polynomial (second kind) evaluated at 2^n.
-
A020543: a(0) = 1, a(1) = 1, a(n+1) = (n+1)*a(n) + n.
-
A020547: 2nd Euler polynomial x^2 - x evaluated at x=n!.
-
A020549: a(n) = (n!)^2 + 1.
-
A020550: 4th Fibonacci polynomial evaluated at x=n!.
-
A020551: 5th Fibonacci polynomial evaluated at x = n!.
-
A020574: Smallest nonempty set S containing prime divisors of k + 10 for each k in S.
-
A020576: Smallest nonempty set S containing prime divisors of 2k+3 for each k in S.
-
A020581: Smallest nonempty set S containing prime divisors of 3k+1 for each k in S.
-
A020585: Smallest nonempty set S containing prime divisors of 3k+7 for each k in S.
-
A020590: Smallest nonempty set S containing prime divisors of 4k+5 for each k in S.
-
A020601: Smallest nonempty set S containing prime divisors of 5k+9 for each k in S.
-
A020625: Smallest nonempty set S containing prime divisors of 9k+3 for each k in S.
-
A020695: Pisot sequence E(2,3).
-
A020698: a(n) = 5*a(n-1) - 2*a(n-2), with a(0)=2, a(1)=9.
-
A020699: Expansion of (1-3*x)/(1-5*x).
-
A020701: Pisot sequences E(3,5), P(3,5).
-
A020704: Pisot sequences E(3,10), P(3,10).
-
A020705: a(n) = n + 4.
-
A020706: Pisot sequences L(4,6), E(4,6).
-
A020707: Pisot sequences E(4,8), L(4,8), P(4,8), T(4,8).
-
A020710: a(n) = n + 5.
-
A020711: Pisot sequences E(5,7), P(5,7).
-
A020712: Pisot sequences E(5,8), P(5,8).
-
A020714: a(n) = 5 * 2^n.
-
A020715: a(n) = n + 6.
-
A020717: Pisot sequences L(6,9), E(6,9).
-
A020719: a(n) = n + 7.
-
A020721: Pisot sequences E(7,10), P(7,10).
-
A020722: a(n) = n + 8.
-
A020723: a(n) = n + 9.
-
A020725: Integers >= 2. a(n) = n+1.
-
A020727: Pisot sequence P(2,7): a(0)=2, a(1)=7, thereafter a(n+1) is the nearest integer to a(n)^2/a(n-1).
-
A020729: Pisot sequences E(2,10), L(2,10), P(2,10), T(2,10).
-
A020732: Pisot sequence T(4,7).
-
A020735: Odd numbers >= 5.
-
A020737: Pisot sequence L(5,9).
-
A020739: a(n) = 2*n + 6.
-
A020742: Pisot sequence T(7,9).
-
A020743: Pisot sequence L(7,10).
-
A020744: Pisot sequences P(8,10), T(8,10).
-
A020745: Pisot sequence T(3,5).
-
A020749: Pisot sequence T(5,8), a(n) = floor(a(n-1)^2/a(n-2)).
-
A020761: Decimal expansion of 1/2.
-
A020773: Decimal expansion of 1/4.
-
A020793: Decimal expansion of 1/6.
-
A020806: Decimal expansion of 1/7.
-
A020821: Decimal expansion of 1/8.
-
A020871: Number of spanning trees in a Moebius ladder M_n with 2n vertices.
-
A020873: a(n) is number of cycles in Moebius ladder M_n.
-
A020874: Number of paths in Moebius ladder M_n.
-
A020875: Number of (undirected) Hamiltonian paths in n-Moebius ladder.
-
A020876: a(n) = ((5+sqrt(5))/2)^n + ((5-sqrt(5))/2)^n.
-
A020878: Number of maximum matchings in the n-Moebius ladder M_n.
-
A020903: Lim f(f(…f(n))) where f is the fractal sequence given by f(n)=A002260(n+1).
-
A020911: Number of digits in the base 3 representation of n-th Fibonacci number.
-
A020913: Number of terms in base 5 representation of Fibonacci(n).
-
A020918: Expansion of 1/(1-4*x)^(7/2).
-
A020920: Expansion of 1/(1-4*x)^(9/2).
-
A020922: Expansion of 1/(1-4*x)^(11/2).
-
A020924: Expansion of 1/(1-4*x)^(13/2).
-
A020928: Expansion of 1/(1-4*x)^(17/2).
-
A020956: a(n) = Sum_{k>=1} floor(tau^(n-k)) where tau is A001622.
-
A020962: a(n) = Sum_{k >= 1} floor((1+sqrt(2))^(n-k)).
-
A020963: Sum of Floor[ 2*(1+sqrt(2))^(n-k) ] for k from 1 to infinity.
-
A020988: a(n) = (2/3)*(4^n-1).
-
A020989: a(n) = (5*4^n - 2)/3.