cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A010815 From Euler's Pentagonal Theorem: coefficient of q^n in Product_{m>=1} (1 - q^m).

Original entry on oeis.org

1, -1, -1, 0, 0, 1, 0, 1, 0, 0, 0, 0, -1, 0, 0, -1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
Offset: 0

Views

Author

Keywords

Comments

When convolved with the partition numbers A000041 gives 1, 0, 0, 0, 0, ...
Also, number of different partitions of n into parts of -1 different kinds (based upon formal analogy). - Michele Dondi (blazar(AT)lcm.mi.infn.it), Jun 29 2004
The comment that "when convolved with the partition numbers gives [1, 0, 0, 0, ...]" is equivalent to row sums of triangle A145975 = [1, 0, 0, 0, ...]; where A145975 is a partition number convolution triangle. - Gary W. Adamson, Oct 25 2008
When convolved with n-th partial sums of A000041 = the binomial sequence starting (1, n, ...). Example: A010815 convolved with A014160 (partial sum operation applied thrice to the partition numbers) = (1, 3, 6, 10, ...). - Gary W. Adamson, Nov 11 2008
(A000012^(-n) * A000041) convolved with A010815 = n-th row of the inverse of Pascal's triangle, (as a vector, followed by zeros); where A000012^(-1) = the pairwise difference operator. Example: (A000012^(-4) * A000041) convolved with A010815 = (1, -4, 6, -4, 1, 0, 0, 0, ...). - Gary W. Adamson, Nov 11 2008
Also sum of [product of (1-2/(hook lengths)^2)] over all partitions of n. - Wouter Meeussen, Sep 16 2010
Cayley (1895) begins article 387 with "Write for shortness sqrt(2k'K / pi) / [1-q^{2m-1}]^2 = G, ..." which is a convoluted way of writing G = [1-q^{2m}] = (1-q^2)(1-q^4)... - Michael Somos, Aug 01 2011
This is an example of the quintuple product identity in the form f(a*b^4, a^2/b) - (a/b) * f(a^4*b, b^2/a) = f(-a*b, -a^2*b^2) * f(-a/b, -b^2) / f(a, b) where a = x^3, b = x. - Michael Somos, Jan 21 2012
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Number 1 of the 14 primitive eta-products which are holomorphic modular forms of weight 1/2 listed by D. Zagier on page 30 of "The 1-2-3 of Modular Forms". - Michael Somos, May 04 2016

Examples

			G.f. = 1 - x - x^2 + x^5 + x^7 - x^12 - x^15 + x^22 + x^26 - x^35 - x^40 + ...
G.f. = q - q^25 - q^49 + q^121 + q^169 - q^289 - q^361 + q^529 + q^625 + ...
From _Seiichi Manyama_, Mar 04 2017: (Start)
G.f.
= 1 + (-x - 3*x^2/2 - 4*x^3/3 -  7*x^4/4  -  6*x^5/5 - ...)
     + 1/2 * (x^2   + 3*x^3   + 59*x^4/12 + 15*x^5/2 + ...)
              + 1/6 * (-x^3   -  9*x^4/2  - 43*x^5/4 - ...)
                         + 1/24 * (x^4    +  6*x^5   + ...)
                                   + 1/120 * (-x^5   - ...)
                                             + ...
= 1 - x - x^2 + x^5 + .... (End)
		

References

  • M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972, p. 825.
  • B. C. Berndt, Ramanujan's theory of theta-functions, Theta functions: from the classical to the modern, Amer. Math. Soc., Providence, RI, 1993, pp. 1-63. MR 94m:11054. See page 3.
  • T. J. I'a. Bromwich, Introduction to the Theory of Infinite Series, Macmillan, 2nd. ed. 1949, p. 116, Problem 18.
  • A. Cayley, An Elementary Treatise on Elliptic Functions, G. Bell and Sons, London, 1895, p. 295, Art. 387.
  • L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 104, [5g].
  • N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 77, Eq. (32.12) and (32.13).
  • G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, Cambridge, University Press, 1940, p. 86.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, Theorem 353.
  • B. Schoeneberg, Elliptic Modular Functions, Springer-Verlag, NY, 1974, p. 70.
  • A. Weil, Number theory: an approach through history; from Hammurapi to Legendre, Birkhäuser, Boston, 1984; see p. 186.

Crossrefs

Programs

  • Julia
    # DedekindEta is defined in A000594.
    A010815List(len) = DedekindEta(len, 1)
    A010815List(93) |> println # Peter Luschny, Mar 09 2018
    
  • Julia
    function A010815(n)
        r = 24 * n + 1
        m = isqrt(r)
        m * m != r && return 0
        iseven(div(m + m % 6, 6)) ? 1 : -1
    end # Peter Luschny, Sep 09 2021
  • Magma
    Coefficients(&*[1-x^m:m in [1..100]])[1..100] where x is PolynomialRing(Integers()).1; // Vincenzo Librandi, Jan 15 2017
    
  • Maple
    A010815 := mul((1-x^m), m=1..100);
    A010815 := proc(n) local x,m;
        product(1-x^m,m=1..n) ;
        expand(%) ;
        coeff(%,x,n) ;
    end proc: # R. J. Mathar, Jun 18 2016
    A010815 := proc(n) 24*n + 1; if issqr(%) then sqrt(%);
    (-1)^irem(iquo(% + irem(%, 6), 6), 2) else 0 fi end: # Peter Luschny, Oct 02 2022
  • Mathematica
    a[ n_] := SeriesCoefficient[ Product[ 1 - x^k, {k, n}], {x, 0, n}]; (* Michael Somos, Nov 15 2011 *)
    a[ n_] := If[ n < 0, 0, SeriesCoefficient[ (Series[ EllipticTheta[ 3, Log[y] / (2 I), x^(3/2)], {x, 0, n + Floor@Sqrt[n]}] // Normal // TrigToExp) /. {y -> -x^(1/2)}, {x, 0, n}]]; (* Michael Somos, Nov 15 2011 *)
    CoefficientList[ Series[ Product[(1 - x^k), {k, 1, 70}], {x, 0, 70}], x]
    (* hooklength[ ] cfr A047874 *) Table[ Tr[ ( Times@@(1-2/Flatten[hooklength[ # ]]^2) )&/@ Partitions[n] ],{n,26}] (* Wouter Meeussen, Sep 16 2010 *)
    CoefficientList[ Series[ QPochhammer[q], {q, 0, 100}], q] (* Jean-François Alcover, Dec 04 2013 *)
    a[ n_] := With[ {m = Sqrt[24 n + 1]}, If[ IntegerQ[m], KroneckerSymbol[ 12, m], 0]]; (* Michael Somos, Jun 04 2015 *)
    nmax = 100; poly = ConstantArray[0, nmax + 1]; poly[[1]] = 1; poly[[2]] = -1; Do[Do[poly[[j + 1]] -= poly[[j - k + 1]], {j, nmax, k, -1}];, {k, 2, nmax}]; poly (* Vaclav Kotesovec, May 04 2018 *)
    Table[m = (1 + Sqrt[1 + 24*k])/6; If[IntegerQ[m], (-1)^m, 0] + If[IntegerQ[m - 1/3], (-1)^(m - 1/3), 0], {k, 0, 100}] (* Vaclav Kotesovec, Jul 09 2020 *)
  • PARI
    {a(n) = if( n<0, 0, polcoeff( eta(x + x * O(x^n)), n))}; /* Michael Somos, Jun 05 2002 */
    
  • PARI
    {a(n) = polcoeff( prod( k=1, n, 1 - x^k, 1 + x * O(x^n)), n)}; /* Michael Somos, Nov 19 2011 */
    
  • PARI
    {a(n) = if( issquare( 24*n + 1, &n), kronecker( 12, n))}; /* Michael Somos, Feb 26 2006 */
    
  • PARI
    {a(n) = if( issquare( 24*n + 1, &n), if( (n%2) && (n%3), (-1)^round( n/6 )))}; /* Michael Somos, Feb 26 2006 */
    
  • PARI
    {a(n) = my(A); if( n<0, 0, A = 1 + O(x^n); polcoeff( sum( k=1, (sqrtint( 8*n + 1)-1) \ 2, A *= x^k / (x^k - 1) + x * O(x^(n - (k^2-k)/2)), 1), n))}; /* Michael Somos, Aug 18 2006 */
    
  • PARI
    lista(nn) = {q='q+O('q^nn); Vec(eta(q))} \\ Altug Alkan, Mar 21 2018
    
  • Python
    from math import isqrt
    def A010815(n):
        m = isqrt(24*n+1)
        return 0 if m**2 != 24*n+1 else ((-1)**((m-1)//6) if m % 6 == 1 else (-1)**((m+1)//6)) # Chai Wah Wu, Sep 08 2021
    

Formula

a(n) = (-1)^m if n is of the form m(3m+-1)/2; otherwise a(n)=0. The values of n such that |a(n)|=1 are the generalized pentagonal numbers, A001318. The values of n such that a(n)=0 is A090864.
Expansion of the Dedekind eta function without the q^(1/24) factor in powers of q.
Euler transform of period 1 sequence [ -1, -1, -1, ...].
G.f.: (q; q){oo} = Product{k >= 1} (1-q^k) = Sum_{n=-oo..oo} (-1)^n*q^(n*(3n+1)/2). The first notation is a q-Pochhammer symbol.
Expansion of f(-x) := f(-x, -x^2) in powers of x. A special case of Ramanujan's general theta function; see Berndt reference. - Michael Somos, Apr 08 2003
a(n) = A067661(n) - A067659(n). - Jon Perry, Jun 17 2003
Expansion of f(x^5, x^7) - x * f(x, x^11) in powers of x where f(, ) is Ramanujan's general theta function. - Michael Somos, Jan 21 2012
G.f.: q^(-1/24) * eta(t), where q = exp(2 Pi i t) and eta is the Dedekind eta function.
G.f.: 1 - x - x^2(1-x) - x^3(1-x)(1-x^2) - ... - Jon Perry, Aug 07 2004
Given g.f. A(x), then B(q) = q * A(q^3)^8 satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = u^2*w - v^3 + 16*u*w^2. - Michael Somos, May 02 2005
Given g.f. A(x), then B(q) = q * A(q^24) satisfies 0 = f(B(q), B(x^q), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u1^9*u3*u6^3 - u2^9*u3^4 + 9*u1^4*u2*u6^8. - Michael Somos, May 02 2005
a(n) = b(24*n + 1) where b() is multiplicative with b(p^2e) = (-1)^e if p == 5 or 7 (mod 12), b(p^2e) = +1 if p == 1 or 11 (mod 12) and b(p^(2e-1)) = b(2^e) = b(3^e) = 0 if e>0. - Michael Somos, May 08 2005
Given g.f. A(x), then B(q) = q * A(q^24) satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = u^16*w^8 - v^24 + 16*u^8*w^16. - Michael Somos, May 08 2005
a(n) = (-1)^n * A121373(n). a(25*n + 1) = -a(n). a(5*n + 3) = a(5*n + 4) = 0. a(5*n) = A113681(n). a(5*n + 2) = - A116915(n). - Michael Somos, Feb 26 2006
G.f.: 1 + Sum_{k>0} (-1)^k * x^((k^2 + k) / 2) / ((1 - x) * (1 - x^2) * ... * (1 - x^k)). - Michael Somos, Aug 18 2006
a(n) = -(1/n)*Sum_{k=1..n} sigma(k)*a(n-k). - Vladeta Jovovic, Aug 28 2002
G.f.: A(x) = 1 - x/G(0); G(k) = 1 + x - x^(k+1) - x*(1-x^(k+1))/G(k+1); (continued fraction). - Sergei N. Gladkovskii, Jan 25 2012
Expansion of f(-x^2) * chi(-x) = psi(-x) * chi(-x^2) = psi(x) * chi(-x)^2 = f(-x^2)^2 / psi(x) = phi(-x) / chi(-x) = phi(-x^2) / chi(x) in powers of x where phi(), psi(), chi(), f() are Ramanujan theta functions. - Michael Somos, Nov 16 2015
G.f.: exp( Sum_{n>=1} -sigma(n)*x^n/n ). - Seiichi Manyama, Mar 04 2017
G.f.: Sum_{n >= 0} x^(n*(2*n-1))*(2*x^(2*n) - 1)/Product_{k = 1..2*n} 1 - x^k. - Peter Bala, Feb 02 2021
The g.f. A(x) satisfies A(x^2) = Sum_{n >= 0} x^(n*(n+1)/2) * Product_{k >= n+1} 1 - x^k = 1 - x^2 - x^4 + x^10 + x^14 - x^24 - x^30 + + - - .... - Peter Bala, Feb 12 2021
For m >= 0, A(x) = (1 - x)*(1 - x^2)*...*(1 - x^m) * Sum_{n >= 0} (-1)^n * x^(n*(n+2*m+1)/2) /(Product_{k = 1..n} 1 - x^k). - Peter Bala, Feb 03 2025
From Friedjof Tellkamp, Mar 19 2025: (Start)
Sum_{n>=1} a(n)/n = 6 - 4*Pi/sqrt(3).
Sum_{n>=1} a(n)/n^2 = -108 + 16*sqrt(3)*Pi + 2*Pi^2.
Sum_{n>=1} a(n)/n^k = Sum_{i=0..k} 6^(k-i)*C(-k, k-i)*A(i), where A(i)=(2^i-2)*(3^i-3)*zeta(i) for even i, and A(i)=-G(i/2-1/2)*(2^i+2)*(2*Pi)^i/(sqrt(3)*Gamma(i+1)) for odd i, with G(n>0) as the Glaisher's numbers (A002111) and G(0)=1/2. (End)

Extensions

Additional comments from Michael Somos, Jun 05 2002

A186424 Odd terms in A186423.

Original entry on oeis.org

1, 3, 11, 17, 33, 43, 67, 81, 113, 131, 171, 193, 241, 267, 323, 353, 417, 451, 523, 561, 641, 683, 771, 817, 913, 963, 1067, 1121, 1233, 1291, 1411, 1473, 1601, 1667, 1803, 1873, 2017, 2091, 2243, 2321, 2481, 2563, 2731, 2817, 2993, 3083, 3267, 3361, 3553, 3651
Offset: 0

Views

Author

Reinhard Zumkeller, Feb 21 2011

Keywords

Comments

Sum of odd square and half of even square. - Vladimir Joseph Stephan Orlovsky, May 20 2011
Numbers m such that 6*m-2 is a square. - Bruno Berselli, Apr 29 2016

Crossrefs

Programs

  • Haskell
    a186424 n = a186424_list !! n
    a186424_list = filter odd a186423_list
    
  • Mathematica
    Table[If[OddQ[n],n^2+((n+1)^2)/2,(n^2)/2+(n+1)^2],{n,0,100}] (* Vladimir Joseph Stephan Orlovsky, May 20 2011 *)
  • Python
    def A186424(n): return (n*(3*n + 2) + 1 if n&1 else n*(3*n + 4) + 2)>>1 # Chai Wah Wu, Jan 31 2023

Formula

From R. J. Mathar, Feb 28 2011: (Start)
G.f.: ( -1-2*x-6*x^2-2*x^3-x^4 ) / ( (1+x)^2*(x-1)^3 ).
a(n) = 3*(1+2*n+2*n^2)/4 + (-1)^n*(1+2*n)/4. (End)
a(n+2) = a(n) + A091999(n+2).
Union of A080859 and A126587: a(2*n) = A080859(n) and a(2*n+1) = A126587(n+1).
From Peter Bala, Feb 13 2021: (Start)
Appears to be the sequence of exponents in the following series expansion:
Sum_{n >= 0} (-1)^n * x^n/Product_{k = 1..n} 1 - x^(2*k-1) = 1 - x - x^3 + x^11 + x^17 - x^33 - x^43 + + - - .... Cf. A053253.
More generally, for nonnegative integer N, we appear to have the identity
Product_{j = 1..N} 1/(1 + x^(2*j-1))*( P(N,x) + Sum_{n >= 1} (-1)^n * x^((2*N+1)*n-N)/Product_{k = 1..n} 1 - x^(2*k-1) ) = 1 - x - x^3 + x^11 + x^17 - x^33 - x^43 + + - - ..., where P(N,x) is a polynomial in x of degree N^2 - 1, with the first few values given empirically by
P(0,x) = 0, P(1,x) = 1, P(2,x) = 1 - x^2 + x^3, P(3,x) = 1 - x^2 + x^5 - x^7 + x^8 and P(4,x) = 1 - x^2 - x^4 + x^5 + x^8 - x^9 + x^12 - x^14 + x^15. Cf. A203568. (End)
E.g.f.: ((2 + 5*x + 3*x^2)*cosh(x) + (1 + 7*x + 3*x^2)*sinh(x))/2. - Stefano Spezia, May 08 2021
Sum_{n>=0} 1/a(n) = sqrt(2)*Pi*sinh(sqrt(2)*Pi/3)/(1+2*cosh(sqrt(2)*Pi/3)). - Amiram Eldar, May 11 2025

A143062 Expansion of false theta series variation of Euler's pentagonal number series in powers of x.

Original entry on oeis.org

1, -1, 1, 0, 0, -1, 0, 1, 0, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

Michael Somos, Jul 21 2008

Keywords

Comments

a(n) = sum over all partitions of n into distinct parts of number of partitions with even largest part minus number with odd largest part.
In the Berndt reference replace {a -> 1, q -> x} in equation (3.1) to get g.f. Replace {a -> x, q -> x} to get f(x). G.f. is 1 - f(x) * x / (1 + x).

Examples

			a(5) = -1 +1 -1 = -1 since 5 = 4 + 1 = 3 + 2. a(7) = -1 +1 -1 +1 +1 = 1 since 7 = 6 + 1 = 5 + 2 = 4 + 3 = 4 + 2 + 1.
G.f. = 1 - x + x^2 - x^5 + x^7 - x^12 + x^15 - x^22 + x^26 - x^35 + x^40 + ...
G.f. = q - q^25 + q^49 - q^121 + q^169 - q^289 + q^361 - q^529 + q^625 - q^841 + ...
		

References

  • G. E. Andrews and B. C. Berndt, Ramanujan's lost notebook, Part I, Springer, New York, 2005, MR2135178 (2005m:11001) See Section 9.4, pp. 232-236.
  • Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, see p. 41, 10th equation numerator.

Crossrefs

Programs

  • Mathematica
    a[ n_] := If[ SquaresR[ 1, 24 n + 1] == 2, (-1)^Quotient[ Sqrt[24 n + 1], 3], 0];
    a[ n_] := With[ {m = Sqrt[24 n + 1]}, If[ IntegerQ@m, (-1)^Quotient[ m, 3], 0]]; (* Michael Somos, Nov 18 2015 *)
  • PARI
    {a(n) = if( issquare( 24*n + 1, &n), (-1)^(n \ 3) )};

Formula

a(n) = b(24*n + 1) where b() is multiplicative with b(p^(2*e)) = (-1)^e if p = 5 (mod 6), b(p^(2*e)) = +1 if p = 1 (mod 6) and b(p^(2*e-1)) = b(2^e) = b(3^e) = 0 if e>0.
G.f.: Sum_{k>=0} x^((3*k^2 + k) / 2) * (1 - x^(2*k + 1)) = 1 - Sum_{k>0} x^((3*k^2 - k) / 2) * (1 - x^k).
G.f.: 1 - x / (1 + x) + x^3 / ((1 + x) * (1 + x^2)) - x^6 / ((1 + x) * (1 + x^2) * (1 + x^3)) + ...
G.f.: 1 - x / (1 + x^2) + x^2 / ((1 + x^2) * (1 + x^4)) - x^3 / ((1 + x^2 ) * (1 + x^4) * (1 + x^6)) + ...
|a(n)| = |A010815(n)| = |A080995(n)| = |A199918(n)| = |A121373(n)|.
From Joerg Arndt, Jun 24 2013: (Start)
a(n) = A026838(n) - A026837(n) (Fine's theorem), see the Pak reference.
a(n)=1 if n = k(3k+1)/2, a(n)=-1 if n = k(3k-1)/2, a(n)=0 otherwise.
G.f.: Sum_{n >= 0} (-q)^n * (Product_{k = 1..n-1} 1 + q^k). (End)
a(n) = - A203568(n) unless n=0. a(0) = 1. - Michael Somos, Jul 12 2015
From Peter Bala, Feb 04 2021: (Start)
A conjectural g.f: 1 + Sum_{n >= 0} (-1)^n*x^(2*n-1)/Product_{k = 1..n} 1 + x^(2*k-1).
G.f.: 1 - Sum_{n >= 1} x^(n*(2*n-1))/Product_{k = 1..2*n} 1 + x^k [added Dec 19 2024: see Berndt et al., Entry 9.44]. (End)
Conjectural g.f.: (1/(1 + x)) * (2 - Sum_{n >= 0} (-1)^n * x^(3*n)/Product_{k = 1..n} 1 + x^(2*k)). - Peter Bala, Jan 19 2025
Showing 1-3 of 3 results.