-355

Appears in sequences

• Coefficients in 1/(1+P(x)), where P(x) is the generating function of the primes.at n=17A030018
• First order recursion: a(0)=1; a(n) = sigma(1,n) - a(n-1).at n=43A083238
• First order recursion: a(0) = 1; a(n) = phi(n) - a(n-1) = A000010(n) - a(n-1).at n=60A083239
• The trinomial transform (A027907) gives powers of 3, while the trinomial transform of this sequence shift one place left gives powers of 5.at n=8A101617
• Coefficients of the A-Bailey Mod 9 identity.at n=61A104467
• Inverse square of A061554.at n=56A126127
• Triangle read by rows: matrix product of the Stirling numbers of the first kind with the binomial coefficients.at n=24A126353
• Inverse of Fibonacci convolution array A154929.at n=32A154930
• Numerator of Hermite(n, 5/8).at n=3A159019
• Square array read by antidiagonals, A(n,k) the numerators of the elements of the difference table of the Euler polynomials evaluated at x=1, for n>=0, k>=0.at n=58A227577
• Table with A235538 as first row, and k-th difference of A235538 as (k+1)-th row, read by antidiagonals.at n=52A235539
• Coefficients of "optimum L" polynomials L_n(ω^2) ordered by increasing powers.at n=32A245320
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1", based on the 5-celled von Neumann neighborhood.at n=9A269909
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 413", based on the 5-celled von Neumann neighborhood.at n=9A272010
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 3*x - x^2.at n=53A368154
• a(n) = A325977(A228058(n)).at n=36A389217