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.

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

Cf. A014602, A003173.
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

A138806 Expansion of (theta_3(q) * theta_3(q^27) + theta_2(q) * theta_2(q^27) - 1) / 2 in powers of q.

Original entry on oeis.org

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

Views

Author

Michael Somos, Mar 30 2008

Keywords

Comments

Half the number of integer solutions to x^2 + x*y + 7*y^2 = n. - Jianing Song, Nov 20 2019

Examples

			q + q^4 + 2*q^7 + 3*q^9 + 2*q^13 + q^16 + 2*q^19 + q^25 + 3*q^27 + ...

Links

Crossrefs

Cf. A138805 (number of integer solutions to x^2 + x*y + 7*y^2 = n).
Cf. A033687, A073010, A097195, A123884, A121361.
Similar sequences: A096936, A113406, A110399.

Programs

  • Mathematica
    f[p_, e_] := If[Mod[p, 6] == 1, e + 1, (1 + (-1)^e)/2]; f[2, e_] := 1 - Mod[e, 2]; f[3, e_] := 3; f[3, 1] = 0; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 07 2023 *)
  • PARI
    {a(n) = if( n<1, 0, if( n%3 == 2, 0, if( n%3==1, sumdiv(n, d, kronecker(-3, d)), if( n%9==0, 3 * sumdiv(n/9, d, kronecker(-3, d))))))}
  • PARI
    {a(n) = if( n<1, 0, sumdiv(n, d, kronecker(-3, d)) - if( n%3==0, sumdiv(n/3, d, [0, 1, -1, -3, 1, -1, 3, 1, -1][d%9+1])))}
  • PARI
    {a(n) = if( n<1, 0, qfrep([2, 1; 1, 14], n, 1)[n])}

Formula

a(n) is multiplicative and a(3^e) = 3 if e>1, a(p^e) = e+1 if p == 1 (mod 6), a(p^e) = (1 + (-1)^e) / 2 if p == 5 (mod 6).
a(3*n + 2) = a(4*n + 2) = 0.
G.f.: (Sum_{i,j} x^(i*i + i*j + 7*j*j) - 1) / 2.
A138805(n) = 2 * a(n) unless n=0. A033687(n) = a(3*n + 1). A097195(n) = a(6*n + 1). A123884(n) = a(12*n + 1). 2 * A121361(n) = a(12*n + 7).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/(3*sqrt(3)) = 0.604599... (A073010). - Amiram Eldar, Nov 16 2023

A133827 Number of solutions to x + 7 * y = 2 * n in triangular numbers.

Original entry on oeis.org

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

Views

Author

Michael Somos, Sep 25 2007, Oct 04 2008

Keywords

Comments

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
G.f. is called omega(q) by Berkovich and Yesilyurt.

Examples

			G.f. = 1 + x^3 + x^4 + 2*x^5 + 2*x^11 + x^12 + 2*x^14 + 2*x^18 + 2*x^21 + x^24 + ...
G.f. = q + q^7 + q^9 + 2*q^11 + 2*q^23 + q^25 + 2*q^29 + 2*q^37 + 2*q^43 + q^49 + ...

Links

Crossrefs

Cf. A002652, A033719, A035162, A035182, A110399, A121454.
Cf. A000122, A000700, A010054, A121373.

Programs

  • Mathematica
    a[ n_] := If[ n < 0, 0, DivisorSum[ 2 n + 1, Mod[#, 2] KroneckerSymbol[ -28, #] &]]; (* Michael Somos, Oct 30 2015 *)
a[ n_] := SeriesCoefficient[ (1/4) EllipticTheta[ 2, 0, x^(1/2)] EllipticTheta[ 2, 0, x^(7/2)], {x, 0, 2 n + 1}]; (* Michael Somos, Oct 30 2015 *)
  • PARI
    {a(n) = if( n<0, 0, n = 2*n + 1; sumdiv(n, d, (d%2) * kronecker( -28, d)))};
  • PARI
    {a(n) = my(A, p, e); if( n<0, 0, n = 2*n + 1; A = factor(n); prod(k = 1, matsize(A)[1], [p, e] = A[k, ]; if(p == 2, 0, p == 7, 1, 1 == kronecker( -7, p), e + 1, 1-e%2)))};

Formula

Expansion of psi(x^4) * phi(x^14) + x^3 * psi(x^28) * phi(x^2) in powers of x where phi(), psi() are Ramanujan theta functions.
a(n) = b(2*n + 1) where b() is multiplicative with b(2^e) = 0^e, b(7^e) = 1, b(p^e) = (1 + (-1)^e) / 2 if p == 3, 5, 6 (mod 7), b(p^e) = e + 1 if p == 1, 2, 4 (mod 7).
a(7*n + 1) = a(7*n + 2) = a(7*n + 6) = 0. a(7*n + 3) = a(n).
Expansion of psi(q) * psi(q^7) - q * psi(q^2) * psi(q^14) = (psi(q) * psi(q^7) + psi(-q) * psi(-q^7)) / 2 in powers of q^2 where psi() is a Ramanujan theta function.
a(n) = A035162(2*n + 1) = A035182(2*n + 1) = A110399(2*n + 1) = A121454(2*n + 1).
2 * a(n) = A002652(2*n + 1) = A033719(2*n + 1). - Michael Somos, Dec 30 2016
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/(2*sqrt(7)) = 0.593705... . - Amiram Eldar, Dec 29 2023
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.