-258

Appears in sequences

• q-factorial numbers for q=-7.at n=3A015020
• Equivalent of the Kurepa hypothesis for left factorial.at n=6A054516
• McKay-Thompson series of class 20c for Monster.at n=52A058558
• Expansion of (1-x)/(1+x-2*x^2+2*x^3).at n=7A078040
• Expansion of psi(x) / phi(x) in powers of x where phi(), psi() are Ramanujan theta functions.at n=19A083365
• Series expansion of the Ramanujan-Goellnitz-Gordon continued fraction.at n=76A092869
• G.f. satisfies: A(x) = 1/(1 + x*A(x^2)) and also the continued fraction: 1 + x*A(x^3) = [1; 1/x, 1/x^2, 1/x^4, 1/x^8, ..., 1/x^(2^(n-1)), ...].at n=27A101912
• Series expansion of the reciprocal of the Goellnitz-Gordon continued fraction.at n=77A111374
• Expansion of -1/(1 - x + x^2 - x^3 + x^4 + x^6).at n=36A125629
• Triangle of coefficients of a Pascal sum of recursive orthogonal Hermite polynomials given in Hochstadt's book: P(x, n) = x*P(x, n - 1) - n*P(x, n - 2); p2(x,n)=Sum[Binomial[n,m],{m,0,n}].at n=50A136645
• Triangle T(n,k) read by rows: coefficient [x^k] of the polynomial p(n,x) with p(0,x) = 1, p(1,x) = 2 - x, p(2,x) = 1 - 4*x + x^2 and p(n,x) = (2-x)*p(n-1,x) - p(n-2,x) if n>2.at n=31A136674
• Triangle read by rows: coefficients of a Hermite-like set of recursive polynomials that appear by integration to be orthogonal using the substitution on the Hermite recursion of n->f(n) where f(n)=A000045[n] is the Fibonacci sequence.at n=29A137297
• Triangle T(n,k) = binomial(n,k+2)-2*binomial(n,k+1)-binomial(n,k) read by rows, 0<=k<=n-2, n>=2.at n=33A140874
• Let f(x) = 1 + x^2 + x^4 + x^5 + x^6 + x^10 + x^11; sequence has g.f. g(x) = 1/(x^11*f(1/x)).at n=21A157876
• First differences of A060819(n-4)*A060819(n).at n=20A185688
• G.f. A(x) satisfies A(x) = 1 + x / A(x^2).at n=55A218031
• Numerators of the convolutory inverse of the primes of the form 6m+1.at n=3A225131
• Triangle (read by rows) of coefficients of the polynomials (in ascending order) of the denominators of the generalized sequence s(n) of the sum resp. product of generalized fractions f(n) defined recursively by f(1) = m/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal.at n=23A225201
• Expansion of F(x) where F(x) = 1 + x / (1 - x^2 / F(x^2) ).at n=165A238429
• Triangle read by rows of coefficients of polynomials Q_n(x) = 2^(-n)*((x + sqrt(x*(x + 6) - 3) + 1)^n - (x - sqrt(x*(x + 6) - 3) + 1)^n)/sqrt(x*(x + 6) - 3).at n=84A271451