-141

Appears in sequences

• Nearest integer to Bernoulli(2n)/(-4n).at n=10A003326
• a(n) = floor( Bernoulli(2*n)/(-4*n) ).at n=10A003414
• Expansion of tan(x)/cosh(x).at n=3A003702
• Start with 1, add the next number if one gets a prime then add the next number else subtract the next...at n=20A074170
• Expansion of (1-x)/(1+x+2*x^2-x^3).at n=11A078049
• 4th differences of partition numbers A000041.at n=45A081094
• Matrix square of inverse triangle A096651; transforms n-dimensional partitions into (n-2)-dimensional partitions.at n=46A096875
• Dirichlet inverse of the gcd-sum function (A018804).at n=70A101035
• Triangle of coefficients in the numerators of rational functions in tanh(1) that express the (2n)th du Bois-Reymond constants as C_0 = 0, C_2 = -4 - 1/(1-tanh(1)), for n>1, C_2n = -3 - (Sum_{k=0..n} a(n,k)*tanh(1)^k) / (2^n*n! * (1-tanh(1))^n).at n=27A104053
• Expansion of (-1+x+2*x^2-6*x^3+x^4+x^5) / ((x-1)*(x^2-x+1)*(x^2-2*x-1)*(x+1)^2).at n=6A109781
• G.f. A(x) satisfies: A(x)^3 equals the g.f. of A110640, which consists entirely of numbers 1 through 9.at n=12A112573
• Triangle, real terms extracted from squares of paired terms in arithmetic sequences.at n=51A121164
• Matrix inverse of triangle A122176, where A122176(n,k) = C( k*(k+1)/2 + n-k + 1, n-k) for n>=k>=0.at n=15A121436
• a(n) = -3*a(n-1) + a(n-3) for n>2, with a(0)=1, a(1)=1, a(2)=0.at n=8A122099
• a(n) = 3*a(n-1) - a(n-3) for n>2, with a(0)=1, a(1)=-1, a(2)=0.at n=8A122100
• Expansion of 2*(sqrt(1+8x)-3)/(sqrt(1+8x)-5).at n=5A122441
• Number of partitions of n with even crank minus number of partitions of n with odd crank.at n=33A124226
• Inverse square of A061554.at n=49A126127
• Expansion of phi(-x) * chi(-x) in powers of x where phi(), chi() are Ramanujan theta functions.at n=33A132970
• Expansion of chi(-q) / chi(-q^5) in powers of q where chi() is a Ramanujan theta function.at n=71A133563