-269

Appears in sequences

• Coefficients of modular function G_2(tau).at n=29A005760
• Numerator of the coefficient of [x^(2n)] of the Taylor series log(cosec(x)*arcsinh(x)).at n=3A012859
• Expansion of 1/(1-2*x+x^2+x^3).at n=16A077941
• Expansion of 1 / (1 + x^2 - x^3) in powers of x.at n=35A077961
• Expansion of 1/(1 + 2*x + x^2 - x^3).at n=16A077990
• A measure of how close r^n is to an integer where r is the real root of x^3-x-1, i.e.. r = (1/2 + sqrt(23/108))^(1/3) + (1/2 - sqrt(23/108))^(1/3) = 1.3247.... (Higher absolute value of a(n) means closer, negative means less than closest integer.)at n=43A084252
• Expansion of g.f. (1+x-2*x^2+x^3+x^4)/((1-x)^2*(1+x)^2*(1+2*x)^2).at n=7A106691
• Inverse square of A061554.at n=59A126127
• a(n) = -n^2 + 9*n + 53.at n=23A126665
• a(n) = -5*a(n-1)-2*a(n-2), n>1 ; a(0)=1, a(1)=-1 .at n=5A152594
• G.f. satisfies: A(x) = 1 + x*A(x) / ( A(I*x)*A(-I*x) ).at n=16A216683
• Values of n such that L(20) and N(20) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=2A227523
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 133", based on the 5-celled von Neumann neighborhood.at n=9A270235
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 197", based on the 5-celled von Neumann neighborhood.at n=9A270719
• a(n) = (-1)^n*prime(n).at n=56A273960
• Rectangular array read by antidiagonals: a(m,n) = 2 * Integral_{t>=0} T_n((t-m)/2)*exp(-t)*dt, m>=0, n>=0, where T_n(x) is n-th Chebyshev polynomial of first kind.at n=50A300481
• Expansion of Product_{k>=1} (1 - x^k * (1 + x)).at n=55A306565
• G.f. A(x) satisfies: 1/(1 - x) = A(x)*A(x^2)^2*A(x^3)^3*A(x^4)^4* ... *A(x^k)^k* ...at n=19A307648
• L.g.f.: log(Product_{k>=1} (1 + x^k/(1 + x))) = Sum_{k>=1} a(k)*x^k/k.at n=7A307762
• The sequence is {a(n), n>=0}, the concatenation of the binary expansions of the absolute values |a(n)| is {b(n), n>=0}; start with a(0)=0; thereafter a(n) = a(n-1)+n if b(n-1)=0, otherwise a(n) = a(n-1)-n.at n=49A309217