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-9 of 9 results.

A033715 Number of integer solutions (x, y) to the equation x^2 + 2y^2 = n.

Original entry on oeis.org

1, 2, 2, 4, 2, 0, 4, 0, 2, 6, 0, 4, 4, 0, 0, 0, 2, 4, 6, 4, 0, 0, 4, 0, 4, 2, 0, 8, 0, 0, 0, 0, 2, 8, 4, 0, 6, 0, 4, 0, 0, 4, 0, 4, 4, 0, 0, 0, 4, 2, 2, 8, 0, 0, 8, 0, 0, 8, 0, 4, 0, 0, 0, 0, 2, 0, 8, 4, 4, 0, 0, 0, 6, 4, 0, 4, 4, 0, 0, 0, 0, 10, 4, 4, 0, 0, 4, 0, 4, 4, 0, 0, 0, 0, 0, 0, 4, 4, 2, 12, 2, 0, 8, 0
Offset: 0

Views

Author

Keywords

Comments

Theta series of lattice C2 with Gram matrix [ 1, 0; 0, 2]. a(n) is nonzero if and only if n is in A002479. - Michael Somos, Dec 15 2011
Number 17 of the 74 eta-quotients listed in Table I of Martin (1996).
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Denoted by |a_4(n)| in Kassel and Reutenauer 2015. - Michael Somos, Jun 16 2015

Examples

			G.f. = 1 + 2*q + 2*q^2 + 4*q^3 + 2*q^4 + 4*q^6 + 2*q^8 + 6*q^9 + 4*q^11 + 4*q^12 + ...
		

References

  • Bruce C. Berndt, Ramanujan's Notebooks Part III, Springer-Verlag, 1991, see p. 114 Entry 8(iii).
  • J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer-Verlag, 1999, p. 102, eq. 9.
  • L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 3, p. 19.
  • Nathan J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 78, Eq. (32.24).
  • J. W. L. Glaisher, Table of the excess of the number of (8k+1)- and (8k+3)-divisors of a number over the number of (8k+5)- and (8k+7)-divisors, Messenger Math., 31 (1901), 82-91.
  • J. V. Uspensky and M. A. Heaslet, Elementary Number Theory, McGraw-Hill, NY, 1939, p. 346.

Crossrefs

Number of integer solutions to f(x,y) = n where f(x,y) is the principal binary quadratic form with discriminant d: A004016 (d=-3), A004018 (d=-4), A002652 (d=-7), this sequence (d=-8), A028609 (d=-11), A028641 (d=-19), A138811 (d=-43).

Programs

  • Magma
    A := Basis( ModularForms( Gamma1(8), 1), 105); A[1] + 2*A[2] + 2*A[3]; /* Michael Somos, Aug 29 2014 */
  • Maple
    d:=proc(r,m,n) local i,t1; t1:=0; for i from 1 to n do if n mod i = 0 and i-r mod m = 0 then t1:=t1+1; fi; od: t1; end; [seq(2*(d(1,8,n)+d(3,8,n)-d(5,8,n)-d(7,8,n)),n=1..120)];
  • Mathematica
    a[ n_] := SeriesCoefficient[ EllipticTheta[ 3, 0, q] EllipticTheta[ 3, 0, q^2], {q, 0, n}]; (* Michael Somos, Sep 09 2012 *)
    a[ n_] := If[ n < 1, Boole[ n == 0], 2 DivisorSum[ n, KroneckerSymbol[ -2, #] &]]; (* Michael Somos, Aug 29 2014 *)
    a[ n_] := SeriesCoefficient[ (QPochhammer[ q^2] QPochhammer[ q^4])^3 / (QPochhammer[ q] QPochhammer[ q^8])^2, {q, 0, n}]; (* Michael Somos, Aug 29 2014 *)
  • PARI
    {a(n) = if( n<1, n==0, 2 * (issquare(n) - issquare(2*n) + 2 * sum( i=1, sqrtint(n\2), issquare(n - 2*i^2))))};
    
  • PARI
    {a(n) = if( n<1, n==0, 2 * sumdiv( n, d, kronecker( -2, d)))}; /* Michael Somos, Aug 23 2005 */
    
  • PARI
    {a(n) = if( n<1, n==0, 2 * qfrep([ 1, 0; 0, 2], n)[n])}; /* Michael Somos, Aug 23 2005 */
    
  • PARI
    {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A)^-2 * eta(x^2 + A)^3 * eta(x^4 + A)^3 * eta(x^8 + A)^-2, n))};
    
  • Sage
    Q = DiagonalQuadraticForm(ZZ, [1,2]); Q.representation_number_list(104); # Peter Luschny, Jun 20 2014
    

Formula

Fine gives an explicit formula for a(n) in terms of the divisors of n.
Euler transform of period 8 sequence [ 2, -1, 2, -4, 2, -1, 2, -2, ...].
Expansion of (eta(q^2) * eta(q^4))^3 / (eta(q) * eta(q^8))^2 in powers of q.
Coefficients in expansion of Sum_{i,j=-inf..inf} q^(i^2 + 2*j^2).
G.f. = s(2)^3*s(4)^3/(s(1)^2*s(8)^2), where s(k) := subs(q=q^k, eta(q)), where eta(q) is Dedekind's function, cf. A010815. [Fine]
G.f.: 1 + 2 * Sum_{k>0} Kronecker(-2, n) * x^k / (1 - x^k) = 1 + 2 * Sum_{k>0} (x^k + x^(3*k)) / (1 + x^(4*k)).
G.f.: theta_3(q) * theta_3(q^2) = Product_{k>0} (1 + x^(2*k)) * ((1 + x^k) * (1 - x^(2*k)) / (1 + x^(4*k)))^2.
From Michael Somos, Oct 23 2006: (Start)
Moebius transform is period 8 sequence [ 2, 0, 2, 0, -2, 0, -2, 0, ...].
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = (u1 - 3*u3) * (u1 - u2 - u3 + u6) - (u2 - 3*u6) * (u1 - 2*u2 - u3 + 2*u6). (End)
a(n) = 2 * A002325(n) unless n = 0.
G.f. is a period 1 Fourier series which satisfies f(-1 / (8 t)) = 8^(1/2) (t/i) f(t) where q = exp(2 Pi i t). - Michael Somos, Sep 09 2012
From Michael Somos, Aug 29 2014: (Start)
Expansion of phi(q) * phi(q^2) in powers of q where phi() is a Ramanujan theta function.
a(2*n) = a(n). a(2*n + 1) = 2 * A113411(n). (End)
From Michael Somos, May 17 2015: (Start)
a(n) = A028572(4*n) = A133692(2*n) = A139093(8*n) = A226225(8*n) = A226240(4*n) = A242609(4*n) = A245572(4*n) / 3 = (-1)^floor((n + 1)/2) * A082564(n).
a(8*n + 5) = a(8*n + 7) = 0. a(8*n + 1) = 2 * A112603(n). a(8*n + 3) = 4 * A033761(n). (End)
a(0) = 1, a(n) = 2 * b(n) for n > 0, where b() is multiplicative with b(2^e) = 1, b(p^e) = e + 1 if p == 1, 3 (mod 8), b(p^e) = (1 + (-1)^e)/2 if p == 5, 7 (mod 8). - Jianing Song, Sep 04 2018 [Corrected by Jeremy Lovejoy, Nov 12 2024]
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=0..m} a(k) = Pi/sqrt(2) = 2.221441... (A247719). - Amiram Eldar, Dec 16 2023

A002652 Theta series of Kleinian lattice Z[(1 + sqrt(-7))/ 2] in 1 complex (or 2 real) dimensions.

Original entry on oeis.org

1, 2, 4, 0, 6, 0, 0, 2, 8, 2, 0, 4, 0, 0, 4, 0, 10, 0, 4, 0, 0, 0, 8, 4, 0, 2, 0, 0, 6, 4, 0, 0, 12, 0, 0, 0, 6, 4, 0, 0, 0, 0, 0, 4, 12, 0, 8, 0, 0, 2, 4, 0, 0, 4, 0, 0, 8, 0, 8, 0, 0, 0, 0, 2, 14, 0, 0, 4, 0, 0, 0, 4, 8, 0, 8, 0, 0, 4, 0, 4, 0, 2, 0, 0, 0, 0, 8, 0, 16, 0, 0, 0, 12, 0, 0, 0, 0, 0, 4, 4, 6, 0
Offset: 0

Views

Author

Keywords

Comments

In other words, theta series of lattice with Gram matrix [2, 1; 1, 4].
The number of integer solutions (x, y) to x^2 + x*y + 2*y^2 = n.
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Examples

			G.f. = 1 + 2*x + 4*x^2 + 6*x^4 + 2*x^7 + 8*x^8 + 2*x^9 + 4*x^11 + 4*x^14 + ...
Theta series of lattice with Gram matrix [2, 1; 1, 4] = 1 + 2*q^2 + 4*q^4 + 6*q^8 + 2*q^14 + 8*q^16 + 2*q^18 + 4*q^22 + 4*q^28 + 10*q^32 + 4*q^36 + 8*q^44 + 4*q^46 + 2*q^50 + 6*q^56 + 4*q^58 + 12*q^64 + 6*q^72 + ...
		

References

  • Bruce C. Berndt, Ramanujan's Notebooks Part III, Springer-Verlag, 1991, see p. 467, Entry 5(i).

Crossrefs

Number of integer solutions to f(x,y) = n where f(x,y) is the principal binary quadratic form with discriminant d: A004016 (d=-3), A004018 (d=-4), this sequence (d=-7), A033715 (d=-8), A028609 (d=-11), A028641 (d=-19), A138811 (d=-43).

Programs

  • Magma
    A := Basis( ModularForms( Gamma1(14), 1), 85); A[1] + 2*A[2] + 4*A[3] + 6*A[5]; /* Michael Somos, Jun 10 2015 */
  • Mathematica
    f[d_] := KroneckerSymbol[-7, d]; a[n_] := 2*Total[f /@ Divisors[n]]; a[0]=1; Table[a[n], {n, 0, 101}] (* Jean-François Alcover, Nov 08 2011, after Michael Somos *)
    a[ n_] := If[ n < 1, Boole[n == 0], 2 Sum[ KroneckerSymbol[ -7, d], { d, Divisors[ n]}]]; (* Michael Somos, Jun 10 2015 *)
    a[ n_] := If[ n < 1, Boole[n == 0], 2 DivisorSum[ n, KroneckerSymbol[ -7, #] &]]; (* Michael Somos, Jun 10 2015 *)
    a[ n_] := If[ n < 1, Boole[n == 0], Length @ FindInstance[ n == x^2 + x y + 2 y^2, {x, y}, Integers, 10^9]]; (* Michael Somos, Jun 10 2015 *)
  • PARI
    {a(n) = my(t2, t3); if( n<1, n==0, t2 = 2 * sum( n=1, (sqrtint( max(0, 4*n - 7)) + 1)\2, x^(n*n - n)); t3 = 1 + 2 * sum( n=1, sqrtint(n), x^(n*n)); polcoeff( t3 * subst(t3, x, x^7) + x^2 * t2 * subst(t2, x, x^7), n))};
    
  • PARI
    {a(n) = my(t); if( n<1, n==0, 2 * issquare(n) + 2 * sum( y=1, sqrtint(n*4\7), 2 * issquare(t = 4*n - 7*y^2) - (t==0)))}; /* Michael Somos, Sep 20 2004 */
    
  • PARI
    {a(n) = my(A, A1, A2); if( n<0, 0, A = x * O(x^n); A1 = eta(x + A) * eta(x^7 + A); A2 = eta(x^2 + A) * eta(x^14 + A); polcoeff( (A1^3 + 4 * x * A2^3) / (A1 * A2), n))}; /* Michael Somos, May 28 2005 */
    
  • PARI
    {a(n) = if( n<1, n==0, 2 * qfrep( [ 2, 1; 1, 4], n, 1)[n])}; /* Michael Somos, Jun 03 2005 */
    
  • PARI
    {a(n) = if( n<1, n==0, 2 * sumdiv( n, d, kronecker( -7, d)))}; /* Michael Somos, Oct 07 2005 */
    

Formula

G.f.: theta_3(q) * theta_3(q^7) + theta_2(q) * theta_2(q^7).
G.f.: 1 + 2 * Sum_{k>0} Kronecker(-7, k) * x^k / (1 - x^k). - Michael Somos, Mar 17 2012
Expansion of phi(x) * phi(x^7) + 4 * x^2 * psi(x^2) * psi(x^14) = phi(-x) * phi(-x^7) + 4 * x * psi(x) * psi(x^7) in powers of x where phi(), psi() are Ramanujan theta functions. - Michael Somos, Mar 17 2012
Expansion of ((eta(q) * eta(q^7))^3 + 4 * (eta(q^2) * eta(q^14))^3) / (eta(q) * eta(q^2) * eta(q^7) * eta(q^14)) in powers of q. - Michael Somos, May 28 2005
Moebius transform is period 7 sequence [ 2, 2, -2, 2, -2, -2, 0, ...]. - Michael Somos, Oct 07 2005
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u^2 + 5 * v^2 + 4 * w^2 + 2 * u*w - 4 * u*v - 8 * v*w. - Michael Somos, Sep 20 2004
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^3), A(x^6)) where f(u1, u2, u3, u6) = u1^3*u6 + 2*u2^3*u3 + 18*u1*u3*u6^2 + 18*u2*u3^2*u6 + 6*u1*u2^2*u6 + 3*u1^2*u2*u3 - 3*u2*u3^3 - 18*u2*u3*u6^2 - 6*u1*u6^3 - 9*u1*u3^2*u6 - 6*u1*u2^2*u3 - 6*u1^2*u2*u6. - Michael Somos, Jun 03 2005
From Michael Somos, Mar 17 2012: (Start)
G.f. is a period 1 Fourier series which satisfies f(-1 / (7 t)) = 7^(1/2) (t/i) f(t) where q = exp(2 Pi i t).
a(n) = 2 * A035182(n) unless n = 0. a(7*n + 5) = a(7*n + 6) = a(9*n + 3) = a(9*n + 6) = 0. a(2*n + 1) = 2 * A133827(n). a(9*n) = a(n). (End)
a(0) = 1, a(n) = 2 * b(n) for n > 0, where b() is multiplicative with b(7^e) = 1, b(p^e) = e + 1 if p == 1, 2, 4 (mod 7), b(p^e) = (1 + (-1)^e) / 2 if p == 3, 5, 6 (mod 7). - Michael Somos, Jun 10 2015
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=0..m} a(k) = 2*Pi/sqrt(7) = 2.3748208... . - Amiram Eldar, Dec 16 2023

A028609 Expansion of (theta_3(z)*theta_3(11z) + theta_2(z)*theta_2(11z)).

Original entry on oeis.org

1, 2, 0, 4, 2, 4, 0, 0, 0, 6, 0, 2, 4, 0, 0, 8, 2, 0, 0, 0, 4, 0, 0, 4, 0, 6, 0, 8, 0, 0, 0, 4, 0, 4, 0, 0, 6, 4, 0, 0, 0, 0, 0, 0, 2, 12, 0, 4, 4, 2, 0, 0, 0, 4, 0, 4, 0, 0, 0, 4, 8, 0, 0, 0, 2, 0, 0, 4, 0, 8, 0, 4, 0, 0, 0, 12, 0, 0, 0, 0, 4, 10, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 4, 8, 0, 0, 0, 4, 0, 6, 6, 0, 0
Offset: 0

Views

Author

Keywords

Comments

Theta series of lattice with Gram matrix [2, 1; 1, 6].
Number of integer solutions (x, y) to x^2 + x*y + 3*y^2 = n. - Michael Somos, Sep 20 2004
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Examples

			G.f. = 1 + 2*x + 4*x^3 + 2*x^4 + 4*x^5 + 6*x^9 + 2*x^11 + 4*x^12 + 8*x^15 + ...
Theta series of lattice with Gram matrix [2, 1; 1, 6] = 1 + 2*q^2 + 4*q^6 + 2*q^8 + 4*q^10 + 6*q^18 + 2*q^22 + 4*q^24 + 8*q^30 + 2*q^32 + 4*q^40 + 4*q^46 + 6*q^50 + 8*q^54 + 4*q^62 + 4*q^66 + 6*q^72 + 4*q^74 + ...
		

References

  • Henry McKean and Victor Moll, Elliptic Curves, Cambridge University Press, 1997, page 202. MR1471703 (98g:14032).

Crossrefs

Number of integer solutions to f(x,y) = n where f(x,y) is the principal binary quadratic form with discriminant d: A004016 (d=-3), A004018 (d=-4), A002652 (d=-7), A033715 (d=-8), this sequence (d=-11), A028641 (d=-19), A138811 (d=-43).

Programs

  • Magma
    A := Basis( ModularForms( Gamma1(11), 1), 103); A[1] + 2*A[2] + 4*A[4] + 2*A[5]; /* Michael Somos, Jul 12 2014 */
  • Mathematica
    a[ n_] := If[ n < 1, Boole[ n == 0], DivisorSum[ n, KroneckerSymbol[ -11, #] &] 2]; (* Michael Somos, Jul 12 2014 *)
    a[ n_] := SeriesCoefficient[ EllipticTheta[ 3, 0, q] EllipticTheta[ 3, 0, q^11] + EllipticTheta[ 2, 0, q] EllipticTheta[ 2, 0, q^11], {q, 0, n}]; (* Michael Somos, Jul 12 2014 *)
  • PARI
    {a(n) = my(t); if( n<1, n==0, 2 * issquare(n) + 2 * sum( y=1, sqrtint(n * 4\11), 2 * issquare( t=4*n - 11*y^2) - (t==0)))}; /* Michael Somos, Sep 20 2004 */
    
  • PARI
    {a(n) = if( n<0, 0, polcoeff( 1 + 2 * x * Ser(qfrep( [ 2, 1; 1, 6], n, 1)), n))}; /* Michael Somos, Apr 21 2015 */
    
  • PARI
    {a(n) = if( n<1, n==0, direuler( p=2, n, 1 / (1 - X) / (1 - kronecker( -11, p) * X))[n] * 2)}; /* Michael Somos, Jun 05 2005 */
    
  • PARI
    {a(n) = if( n<1, n==0, 2 * sumdiv( n, d, kronecker( -11, d)))}; /* Michael Somos, Jan 29 2007 */
    

Formula

Expansion of phi(x) * phi(x^11) = 4 * x^3 * psi(x^2) * psi(x^22) in powers of x where phi(), psi() are Ramanujan theta functions. - Michael Somos, Apr 21 2015
From Michael Somos, Jan 29 2007: (Start)
Moebius transform is period 11 sequence [ 2, -2, 2, 2, 2, -2, -2, -2, 2, -2, 0, ...].
a(n) = 2 * b(n) and b(n) is multiplicative with b(11^e) = 1, b(p^e) = (1 + (-1)^e) / 2 if p == 2, 6, 7, 8, 10 (mod 11), b(p^e) = e + 1 if p == 1, 3, 4, 5, 9 (mod 11).
G.f.: 1 + 2 * Sum_{k>0} Kronecker( -11, k) * x^k / (1 - x^k). (End)
G.f. is a period 1 Fourier series which satisfies f(-1 / (11 t)) = 11^(1/2) (t/i) f(t) where q = exp(2 Pi i t). - Michael Somos, Jun 05 2007
Expansion of (F(x)^2 + 4 * F(x^2)^2 + 8 * F(x^4)^2) / F(x^2) in powers of x or expansion of (F(x)^2 + 2 * F(x^2)^2 + 2 * F(x^4)^2) / F(x^2) in powers of x^4 where F(x) = x^(1/2) * f(-x) * f(-x^11) and f() is a Ramanujan theta function. - Michael Somos, Mar 01 2010
a(n) = 2 * A035179(n) unless n=0. Convolution square is A028610.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=0..m} a(k) = 2*Pi/sqrt(11) = 1.894451... . - Amiram Eldar, Dec 16 2023

A133675 Negative discriminants with form class number 1 (negated).

Original entry on oeis.org

3, 4, 7, 8, 11, 12, 16, 19, 27, 28, 43, 67, 163
Offset: 1

Views

Author

N. J. A. Sloane, May 16 2003

Keywords

Comments

The list on p. 260 of Cox is missing -12, the list in Theorem 7.30 on p. 149 is correct. - Andrew V. Sutherland, Sep 02 2012
Let b(k) be the number of integer solutions of f(x,y) = k, where f(x,y) is the principal binary quadratic form with discriminant d<0 (i.e., f(x,y) = x^2 - (d/4)*y^2 if 4|d, x^2 + x*y + ((1-d)/4)*y^2 otherwise), then this sequence lists |d| such that {b(k)/b(1): k>=1} is multiplicative. See Crossrefs for the actual sequences. - Jianing Song, Nov 20 2019

References

  • D. A. Cox, Primes of the form x^2+ny^2, Wiley, New York, 1989, pp. 149, 260.
  • D. E. Flath, Introduction to Number Theory, Wiley-Interscience, 1989.

Crossrefs

The sequences {b(k): k>=0}: A004016 (d=-3), A004018 (d=-4), A002652 (d=-7), A033715 (d=-8), A028609 (d=-11), A033716 (d=-12), A004531 (d=-16), A028641 (d=-19), A138805 (d=-27), A033719 (d=-28), A138811 (d=-43), A318984 (d=-67), A318985 (d=-163).
The sequences {b(k)/b(1): k>=1}: A002324 (d=-3), A002654 (d=-4), A035182 (d=-7), A002325 (d=-8), A035179 (d=-11), A096936 (d=-12), A113406 (d=-16), A035171 (d=-19), A138806 (d=-27), A110399 (d=-28), A035147 (d=-43), A318982 (d=-67), A318983 (d=-163).

Programs

  • PARI
    ok(n)={(-n)%4<2 && quadclassunit(-n).no == 1} \\ Andrew Howroyd, Jul 20 2018

Extensions

Corrected by David Brink, Dec 29 2007

A028641 Expansion of theta_3(q) * theta_3(q^19) + theta_2(q) * theta_2(q^19) in powers of q.

Original entry on oeis.org

1, 2, 0, 0, 2, 4, 0, 4, 0, 2, 0, 4, 0, 0, 0, 0, 2, 4, 0, 2, 4, 0, 0, 4, 0, 6, 0, 0, 4, 0, 0, 0, 0, 0, 0, 8, 2, 0, 0, 0, 0, 0, 0, 4, 4, 4, 0, 4, 0, 6, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 4, 0, 4, 2, 0, 0, 0, 4, 0, 0, 0, 0, 4, 0, 0, 2, 8, 0, 0, 4, 2, 0, 4, 0, 8, 0, 0, 0, 0, 0, 0, 4, 0, 0, 4, 0, 0, 0, 4, 6, 4, 0, 0, 0
Offset: 0

Views

Author

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
The number of integer solutions (x, y) to x^2 + x*y + 5*y^2 = n, discriminant -19. - Ray Chandler, Jul 12 2014

Examples

			G.f. = 1 + 2*x + 2*x^4 + 4*x^5 + 4*x^7 + 2*x^9 + 4*x^11 + 2*x^16 + 4*x^17 + 2*x^19 + ...
		

References

  • Robert Fricke, Die elliptischen Funktionen und ihre Anwendungen, Teubner, 1922, Vol. 2, see p. 409, Eq. (19).

Crossrefs

Cf. A035171.
Number of integer solutions to f(x,y) = n where f(x,y) is the principal binary quadratic form with discriminant d: A004016 (d=-3), A004018 (d=-4), A002652 (d=-7), A033715 (d=-8), A028609 (d=-11), this sequence (d=-19), A138811 (d=-43).

Programs

  • Mathematica
    a[ n_] := If[ n < 1, Boole[ n == 0], DivisorSum[ n, KroneckerSymbol[ -19, #] &] 2]; (* Michael Somos, Jun 14 2012 *)
  • PARI
    {a(n) = if( n<1, n==0, sumdiv(n, d, kronecker(-19, d)) * 2)}; /* Michael Somos, Feb 27 2007 */
    
  • PARI
    {a(n) = if( n<1, n==0, qfrep([2, 1;1, 10], n, 1)[n] * 2)}; /* Michael Somos, Feb 27 2007 */

Formula

Theta series of quadratic form with Gram matrix [ 2, 1; 1, 10 ].
Expansion of phi(q) * phi(q^19) + 4 * q^5 * psi(q^2)* psi(q^38) in powers of q where phi(), psi() are Ramanujan theta functions. - Michael Somos, Feb 27 2007
Moebius transform is period 19 sequence [2, -2, -2, 2, 2, 2, 2, -2, 2, -2, 2, -2, -2, -2, -2, 2, 2, -2, 0, ...]. - Michael Somos, Feb 27 2007
a(n) = 2*b(n) where b(n) is multiplicative with a(0) = 1, b(19^e) = 1, b(p^e) = e + 1 if Kronecker(-19, p) = 1, b(p^e) = (1 + (-1)^e)/2 if Kronecker(-19, p) = -1. - Michael Somos, Feb 27 2007
a(n) = 2 * A035171(n) unless n = 0. - Jianing Song, Sep 06 2018
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=0..m} a(k) = 2*Pi/sqrt(19) = 1.441461... . - Amiram Eldar, Dec 16 2023

A341788 Norms of prime elements in Z[(1+sqrt(-43))/2], the ring of integers of Q(sqrt(-43)).

Original entry on oeis.org

4, 9, 11, 13, 17, 23, 25, 31, 41, 43, 47, 49, 53, 59, 67, 79, 83, 97, 101, 103, 107, 109, 127, 139, 167, 173, 181, 193, 197, 229, 239, 251, 269, 271, 281, 283, 293, 307, 311, 317, 337, 353, 359, 361, 367, 379, 397, 401, 431, 439, 443, 461, 479, 487, 509
Offset: 1

Views

Author

Jianing Song, Feb 19 2021

Keywords

Comments

Also norms of prime ideals in Z[(1+sqrt(-43))/2], which is a unique factorization domain. The norm of a nonzero ideal I in a ring R is defined as the size of the quotient ring R/I.
Consists of the primes such that (p,43) >= 0 and the squares of primes such that (p,43) = -1, where (p,43) is the Legendre symbol.
For primes p such that (p,43) = 1, there are two distinct ideals with norm p in Z[(1+sqrt(-43))/2], namely (x + y*(1+sqrt(-43))/2) and (x + y*(1-sqrt(-43))/2), where (x,y) is a solution to x^2 + x*y + 11*y^2 = p; for p = 43, (sqrt(-43)) is the unique ideal with norm p; for primes p with (p,43) = -1, (p) is the only ideal with norm p^2.

Examples

			norm((1 + sqrt(-43))/2) = norm((1 - sqrt(-43))/2) = 11;
norm((3 + sqrt(-43))/2) = norm((3 - sqrt(-43))/2) = 13;
norm((5 + sqrt(-43))/2) = norm((5 - sqrt(-43))/2) = 17;
norm((7 + sqrt(-43))/2) = norm((7 - sqrt(-43))/2) = 23;
...
norm((19 + sqrt(-43))/2) = norm((19 - sqrt(-43))/2) = 101.
		

Crossrefs

The number of nonassociative elements with norm n (also the number of distinct ideals with norm n) is given by A035147.
The total number of elements with norm n is given by A138811.
Norms of prime ideals in O_K, where K is the quadratic field with discriminant D and O_K be the ring of integers of K: A055673 (D=8), A341783 (D=5), A055664 (D=-3), A055025 (D=-4), A090348 (D=-7), A341784 (D=-8), A341785 (D=-11), A341786 (D=-15*), A341787 (D=-19), A091727 (D=-20*), this sequence (D=-43), A341789 (D=-67), A341790 (D=-163). Here a "*" indicates the cases where O_K is not a unique factorization domain.

Programs

  • PARI
    isA341788(n) = my(disc=-43); (isprime(n) && kronecker(disc,n)>=0) || (issquare(n, &n) && isprime(n) && kronecker(disc,n)==-1)

A035147 Coefficients in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s) + Kronecker(m,p)*p^(-2s))^(-1) for m = -43.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 2, 0, 2, 0, 0, 1, 2, 0, 0, 0, 0, 0, 2, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 1, 2, 0, 0, 2, 0, 1, 0, 0, 2, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 1
Offset: 1

Views

Author

Keywords

Comments

From Jianing Song, Sep 07 2018: (Start)
Half of the number of integer solutions to x^2 + x*y + 11*y^2 = n.
Inverse Moebius transform of A011591. (End)

Crossrefs

Cf. A138811.
Moebius transform gives A011591.

Programs

  • Mathematica
    a[n_] := If[n < 0, 0, DivisorSum[n, KroneckerSymbol[-43, #] &]];
    Table[a[n], {n, 1, 100}] (* G. C. Greubel, Apr 25 2018 *)
  • PARI
    my(m=-43); direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))
    
  • PARI
    a(n) = sumdiv(n, d, kronecker(-43, d)); \\ Amiram Eldar, Nov 18 2023

Formula

From Jianing Song, Sep 07 2018: (Start)
a(n) is multiplicative with a(43^e) = 1, a(p^e) = (1 + (-1)^e) / 2 if Kronecker(-43, p) = -1, a(p^e) = e + 1 if Kronecker(-43, p) = 1.
G.f.: Sum_{k>0} Kronecker(-43, k) * x^k / (1 - x^k).
A138811(n) = 2 * a(n) unless n = 0. (End)
From Amiram Eldar, Nov 18 2023: (Start)
a(n) = Sum_{d|n} Kronecker(-43, d).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/sqrt(43) = 0.479088... . (End)

A318984 Theta series of quadratic form x^2 + x*y + 17*y^2.

Original entry on oeis.org

1, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 4, 0, 4, 0, 0, 0, 4, 0, 2, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 2, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 2, 0, 0, 2, 4, 0, 0, 4, 0, 4, 0, 0, 4, 0, 0, 0, 0, 2, 0, 4, 0, 0, 0
Offset: 0

Views

Author

Jianing Song, Sep 06 2018

Keywords

Comments

Number of integer solutions (x, y) to x^2 + x*y + 17*y^2 = n. Also, a(n) is the number of integral elements with norm n in Q[sqrt(-67)].

Examples

			G.f. = 1 + 2*x + 2*x^4 + 2*x^9 + 2*x^16 + 4*x^17 + 4*x^19 + 4*x^23 + 2*x^25 + 4*x^29 + 2*x^36 + 4*x^37 + 4*x^47 + 2*x^49 + 4*x^59 + 2*x^64 + 2*x^67 + 4*x^68 + 4*x^71 + 4*x^73 + 4*x^76 + ...
		

Crossrefs

Cf. A318982.
Number of integer solutions to f(x,y) = n where f(x,y) is the principal binary quadratic form with discriminant d: A004016 (d=-3), A004018 (d=-4), A002652 (d=-7), A033715 (d=-8), A028609 (d=-11), A028641 (d=-19), A138811 (d=-43), this sequence (d=-67), A318985 (d=-163).

Programs

  • Mathematica
    Join[{1}, a[n_]:=If[n<0, 0, DivisorSum[n, KroneckerSymbol[-67, #] &]];
    2 Table[a[n], {n, 1, 110}]] (* Vincenzo Librandi, Sep 10 2018 *)
  • PARI
    a(n) = if(n, 2*sumdiv(n, d, kronecker(-67, d)), 1)

Formula

G.f.: 1 + 2 * Sum_{k>0} Kronecker(-67, k) * x^k / (1 - x^k).
a(n) = 2 * A318982(n) unless n = 0.
a(0) = 1, a(n) = 2 * b(n) for n > 0, where b() is multiplicative with b(67^e) = 1, b(p^e) = (1 + (-1)^e) / 2 if Kronecker(-67, p) = -1, b(p^e) = e + 1 if Kronecker(-67, p) = 1.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=0..m} a(k) = 2*Pi/sqrt(67) = 0.767613... . - Amiram Eldar, Dec 16 2023

A318985 Theta series of quadratic form x^2 + x*y + 41*y^2.

Original entry on oeis.org

1, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 4, 0, 4, 0, 0, 0, 4, 0, 2, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 2, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 4, 0, 0, 0
Offset: 0

Views

Author

Jianing Song, Sep 06 2018

Keywords

Comments

Number of integer solutions (x, y) to x^2 + x*y + 41*y^2 = n. Also, a(n) is the number of integral elements with norm n in Q[sqrt(-163)].

Examples

			G.f. = 1 + 2*x + 2*x^4 + 2*x^9 + 2*x^16 + 2*x^25 + 2*x^36 + 4*x^41 + 4*x^43 + 4*x^47 + 2*x^49 + 4*x^53 + 4*x^61 + 2*x^64 + 4*x^71 + ...
		

Crossrefs

Cf. A318983.
Number of integer solutions to f(x,y) = n where f(x,y) is the principal binary quadratic form with discriminant d: A004016 (d=-3), A004018 (d=-4), A002652 (d=-7), A033715 (d=-8), A028609 (d=-11), A028641 (d=-19), A138811 (d=-43), A318984 (d=-67), this sequence (d=-163).

Programs

  • Mathematica
    Join[{1}, a[n_]:=If[n<0, 0, DivisorSum[n, KroneckerSymbol[-163, #] &]];
    2 Table[a[n], {n, 1, 110}]] (* Vincenzo Librandi, Sep 10 2018 *)
  • PARI
    a(n) = if(n, 2*sumdiv(n, d, kronecker(-163, d)), 1)

Formula

G.f.: 1 + 2 * Sum_{k>0} Kronecker(-163, k) * x^k / (1 - x^k).
a(n) = 2 * A318983(n) unless n = 0.
a(0) = 1, a(n) = 2 * b(n) for n > 0, where b() is multiplicative with b(163^e) = 1, b(p^e) = (1 + (-1)^e) / 2 if Kronecker(-163, p) = -1, b(p^e) = e + 1 if Kronecker(-163, p) = 1.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=0..m} a(k) = 2*Pi/sqrt(163) = 0.49213705... . - Amiram Eldar, Dec 16 2023
Showing 1-9 of 9 results.