Summary of block A038
Sequences in block A038
Section titled “Sequences in block A038”-
A038057: a(n) = 2^n*n^(n-1).
-
A038058: Number of labeled trees with 2-colored nodes.
-
A038061: a(n) = 3^n*n^(n-1).
-
A038062: Number of labeled trees with 3-colored nodes.
-
A038082: Number of n-node rooted identity trees of height at most 3.
-
A038123: Beatty sequence for Feigenbaum’s constant.
-
A038124: Beatty sequence for Brun’s constant.
-
A038128: Beatty sequence for Euler’s constant (A001620).
-
A038129: Beatty sequence for cube root of 2.
-
A038130: Beatty sequence for 2*Pi.
-
A038154: a(n) = n! * Sum_{k=0..n-2} 1/k!.
-
A038155: a(n) = (n!/2) * Sum_{k=0..n-2} 1/k!.
-
A038156: a(n) = n! * Sum_{k=1..n-1} 1/k!.
-
A038157: a(n) = n! * Sum_{k=1..n-2} 1/k!.
-
A038158: a(n) = (n!/2)*Sum(1/k!, k=1..n-2).
-
A038159: a(n) = n*a(n-1) + 1, a(0) = 2.
-
A038167: G.f.: x*(1+3*x+x^2)/((1-x^2)^2*(1-x^5)).
-
A038179: Result of second stage of sieve of Eratosthenes (after eliminating multiples of 2 and 3).
-
A038189: Bit to left of least significant 1-bit in binary expansion of n.
-
A038198: Numbers n such that n^2 + 7 is a power of 2.
-
A038359: Ranks of certain relations among Euler sums of weight n.
-
A038364: Numbers n such that n = (product of digits of n) + (sum of digits of n).
-
A038503: Sum of every 4th entry of row n in Pascal’s triangle, starting at “n choose 0”.
-
A038504: Sum of every 4th entry of row n in Pascal’s triangle, starting at “n choose 1”.
-
A038505: Sum of every 4th entry of row n in Pascal’s triangle, starting at binomial(n,2).
-
A038507: a(n) = n! + 1.
-
A038508: Expansion of (1-2*x-x^2)/((1-2*x)*(1-2*x+2*x^2)).
-
A038572: a(n) = n rotated one binary place to the right.
-
A038608: a(n) = n*(-1)^n.
-
A038629: Convolution of Catalan numbers A000108 with Catalan numbers but C(0)=1 replaced by 3.
-
A038665: Convolution of A007054 (super ballot numbers) with A000984 (central binomial coefficients).
-
A038685: Ninth powers ending nontrivially in a nonzero ninth power.
-
A038707: a(n) = floor(n*(n+1/2)/2).
-
A038709: a(n) = floor(n*(n+1/2)/4).
-
A038714: Pronic numbers repeated 4 times; a(n) = floor(n/4) * ceiling((n+1)/4).
-
A038715: a(n) = floor(n/4)*ceiling((n+2)/4).
-
A038716: a(n) = floor(n/4)*ceiling((n+3)/4).
-
A038720: a(n) = (n+3)*n!/2.
-
A038723: a(n) = 6*a(n-1) - a(n-2), n >= 2, a(0)=1, a(1)=4.
-
A038725: a(n) = 6*a(n-1) - a(n-2), n >= 2, a(0)=1, a(1)=2.
-
A038737: T(n,n-2), array T as in A038792.
-
A038754: a(2n) = 3^n, a(2n+1) = 2*3^n.
-
A038761: a(n) = 6*a(n-1) - a(n-2), n >= 2, a(0)=1, a(1)=9.
-
A038762: a(n) = 6*a(n-1) - a(n-2) for n >= 2, with a(0)=3, a(1)=13.
-
A038764: a(n) = (9*n^2 + 3*n + 2)/2.
-
A038765: Next-to-last diagonal of A024462.
-
A038797: T(n+4,n), array T as in A038792.
-
A038845: 3-fold convolution of A000302 (powers of 4).
-
A038846: 4-fold convolution of A000302 (powers of 4); expansion of g.f. 1/(1-4*x)^4.
-
A038865: a(n) = (n+3)^3 - n^3.
-
A038866: (n+4)^3 - n^3.
-
A038867: a(n) = (n+5)^3 - n^3.
-
A038990: Expansion of (1-x-x^2+2*x^3) / ((1-x)*(1+x)*(1-3*x+x^2)).