A002654 -id:A002654 - cp's OEIS frontend

A052343 Number of ways to write n as the unordered sum of two triangular numbers (zero allowed).

1, 1, 1, 1, 1, 0, 2, 1, 0, 1, 1, 1, 1, 1, 0, 1, 2, 0, 1, 0, 1, 2, 1, 0, 1, 1, 0, 1, 1, 1, 1, 2, 0, 0, 1, 0, 2, 1, 1, 1, 0, 0, 2, 1, 0, 1, 2, 0, 1, 1, 0, 2, 0, 0, 0, 2, 2, 1, 1, 0, 1, 1, 0, 0, 1, 1, 2, 1, 0, 1, 1, 0, 2, 1, 0, 0, 2, 0, 1, 1, 0, 3, 0, 1, 1, 0, 0, 1, 1, 0, 1, 2, 1, 1, 2, 0, 0, 1, 0, 1, 1, 1

Offset: 0

Christian G. Bower, Jan 23 2000

Number of ways of writing n as a sum of a square and twice a triangular number (zeros allowed). - Michael Somos, Aug 18 2003
a(A020757(n))=0; a(A020756(n))>0; a(A119345(n))=1; a(A118139(n))>1. - Reinhard Zumkeller, May 15 2006
Also, number of ways to write 4n+1 as the unordered sum of two squares of nonnegative integers. - Vladimir Shevelev, Jan 21 2009
The average value of a(n) for n <= x is Pi/4 + O(1/sqrt(x)). - Vladimir Shevelev, Feb 06 2009

			G.f. = 1 + x + x^2 + x^3 + x^4 + 2*x^6 + x^7 + x^9 + x^10 + x^11 + ...

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Vladimir Shevelev, Binary additive problems: recursions for numbers of representations, arXiv:0901.3102 [math.NT], 2009-2013.
Vladimir Shevelev, Binary additive problems: theorems of Landau and Hardy-Littlewood type, arXiv:0902.1046 [math.NT], 2009-2012.

Cf. A000217, A052344, A052345 (greedy inverse), A052346, A052347, A052348, A053587, A056303, A056304.
Cf. A053692, A093518, A121444, A259285, A259287, A260415, A260516.
Cf. A005369, A010052.

a052343 = (flip div 2) . (+ 1) . a008441
-- Reinhard Zumkeller, Jul 25 2014

A052343 := proc(n)
    local a,t1idx,t2idx,t1,t2;
    a := 0 ;
    for t1idx from 0 do
        t1 := A000217(t1idx) ;
        if t1 > n then
            break;
        end if;
        for t2idx from t1idx do
            t2 := A000217(t2idx) ;
            if t1+t2 > n then
                break;
            elif t1+t2 = n then
                a := a+1 ;
            end if;
        end do:
    end do:
    a ;
end proc: # R. J. Mathar, Apr 28 2020

Length[PowersRepresentations[4 # + 1, 2, 2]] & /@ Range[0, 101] (* Ant King, Dec 01 2010 *)
d1[k_]:=Length[Select[Divisors[k],Mod[#,4]==1&]];d3[k_]:=Length[Select[Divisors[k],Mod[#,4]==3&]];f[k_]:=d1[k]-d3[k];g[k_]:=If[IntegerQ[Sqrt[4k+1]],1/2 (f[4k+1]+1),1/2 f[4k+1]];g[#]&/@Range[0,101] (* Ant King, Dec 01 2010 *)
a[ n_] := Length @ Select[ Table[ Sqrt[n - i - i^2], {i, 0, Quotient[ Sqrt[4 n + 1] - 1, 2]}], IntegerQ]; (* Michael Somos, Jul 28 2015 *)
a[ n_] := Length @ FindInstance[ {j >= 0, k >= 0, j^2 + k^2 + k == n}, {k, j}, Integers, 10^9]; (* Michael Somos, Jul 28 2015 *)

{a(n) = if( n<0, 0, sum(i=0, (sqrtint(4*n + 1) - 1)\2, issquare(n - i - i^2)))}; /* Michael Somos, Aug 18 2003 */

a(n) = ceiling(A008441(n)/2). - Reinhard Zumkeller, Nov 03 2009
G.f.: (Sum_{k>=0} x^(k^2 + k)) * (Sum_{k>=0} x^(k^2)). - Michael Somos, Aug 18 2003
Recurrence: a(n) = Sum_{k=1..r(n)} r(2n-k^2+k) - C(r(n),2) - a(n-1) - a(n-2) - ... - a(0), n>=1,a (0)=1, where r(n)=A000194(n+1) is the nearest integer to square root of n+1. For example, since r(6)=3, a(6) = r(12) + r(10) + r(6) - C(3,2) - a(5) - ... - a(0) = 4 + 3 + 3 - 3 - 0 - 1 - 1 - 1 - 1 - 1 = 2. - Vladimir Shevelev, Feb 06 2009
a(n) = A025426(8n+2). - Max Alekseyev, Mar 09 2009
a(n) = (A002654(4n+1) + A010052(4n+1)) / 2. - Ant King, Dec 01 2010
a(2*n + 1) = A053692(n). a(4*n + 1) = A259287(n). a(4*n + 3) = A259285(n). a(6*n + 1) = A260415(n). a(6*n + 4) = A260516(n). - Michael Somos, Jul 28 2015
a(3*n) = A093518(n). a(3*n + 1) = A121444(n). a(9*n + 2) = a(n). a(9*n + 5) = a(9*n + 8) = 0. - Michael Somos, Jul 28 2015
Convolution of A005369 and A010052. - Michael Somos, Jul 28 2015

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

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 0, 1, 3, 1, 0, 2, 2, 0, 2, 1, 0, 3, 0, 1, 0, 0, 0, 2, 1, 2, 4, 0, 0, 2, 2, 1, 0, 0, 0, 3, 2, 0, 4, 1, 2, 0, 2, 0, 3, 0, 0, 2, 1, 1, 0, 2, 2, 4, 0, 0, 0, 0, 0, 2, 0, 2, 0, 1, 2, 0, 2, 0, 0, 0, 2, 3, 0, 2, 2, 0, 0, 4, 2, 1, 5

Offset: 1

N. J. A. Sloane

Coefficients of Dedekind zeta function for the quadratic number field of discriminant 40. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

G. C. Greubel, Table of n, a(n) for n = 1..10000

Dedekind zeta functions for imaginary quadratic number fields of discriminants -3, -4, -7, -8, -11, -15, -19, -20 are A002324, A002654, A035182, A002325, A035179, A035175, A035171, A035170, respectively.
Dedekind zeta functions for real quadratic number fields of discriminants 5, 8, 12, 13, 17, 21, 24, 28, 29, 33, 37, 40 are A035187, A035185, A035194, A035195, A035199, A035203, A035188, A035210, A035211, A035215, A035219, A035192, respectively.
Cf. A038880, A097955.

a[n_] := If[n < 0, 0, DivisorSum[n, KroneckerSymbol[10, #] &]]; Table[ a[n], {n, 1, 100}] (* G. C. Greubel, Apr 27 2018 *)

my(m=10); direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))

a(n) = sumdiv(n, d, kronecker(10, d)); \\ Amiram Eldar, Nov 18 2023

From Amiram Eldar, Nov 18 2023: (Start)
a(n) = Sum_{d|n} Kronecker(10, d).
Multiplicative with a(p^e) = 1 if Kronecker(10, p) = 0 (p = 2 or 5), a(p^e) = (1+(-1)^e)/2 if Kronecker(10, p) = -1 (p is in A038880), and a(p^e) = e+1 if Kronecker(10, p) = 1 (p is in A097955).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2*log(sqrt(10)+3)/sqrt(10) = 1.1500865228... . (End)

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

Original entry on oeis.org

1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 2, 1, 2, 0, 0, 1, 0, 1, 0, 0, 0, 2, 2, 1, 1, 2, 1, 0, 0, 0, 0, 1, 2, 0, 0, 1, 2, 0, 2, 0, 0, 0, 0, 2, 0, 2, 2, 1, 1, 1, 0, 2, 0, 1, 0, 0, 0, 0, 2, 0, 2, 0, 0, 1, 0, 2, 0, 0, 2, 0, 2, 1, 2, 2, 1, 0, 0, 2, 0, 0, 1

Offset: 1

N. J. A. Sloane

Coefficients of Dedekind zeta function for the quadratic number field of discriminant 12. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

G. C. Greubel, Table of n, a(n) for n = 1..10000

Dedekind zeta functions for imaginary quadratic number fields of discriminants -3, -4, -7, -8, -11, -15, -19, -20 are A002324, A002654, A035182, A002325, A035179, A035175, A035171, A035170, respectively.
Dedekind zeta functions for real quadratic number fields of discriminants 5, 8, 12, 13, 17, 21, 24, 28, 29, 33, 37, 40 are A035187, A035185, A035194, A035195, A035199, A035203, A035188, A035210, A035211, A035215, A035219, A035192, respectively.
Cf. A003630, A097933, A196530.

a[n_] := If[n < 0, 0, DivisorSum[n, KroneckerSymbol[12, #] &]]; Table[ a[n], {n, 1, 100}] (* G. C. Greubel, Apr 27 2018 *)

my(m=12); direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))

a(n) = sumdiv(n, d, kronecker(12, d)); \\ Amiram Eldar, Nov 18 2023

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = log(2+sqrt(3))/sqrt(3) = 0.760345... (A196530). - Amiram Eldar, Oct 11 2022
From Amiram Eldar, Nov 18 2023: (Start)
a(n) = Sum_{d|n} Kronecker(12, d).
Multiplicative with a(p^e) = 1 if Kronecker(12, p) = 0 (p = 2 or 3), a(p^e) = (1+(-1)^e)/2 if Kronecker(12, p) = -1 (p is in A003630), and a(p^e) = e+1 if Kronecker(12, p) = 1 (p is in A097933). (End)

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

Original entry on oeis.org

1, 1, 2, 1, 0, 2, 1, 1, 3, 0, 0, 2, 0, 1, 0, 1, 0, 3, 2, 0, 2, 0, 0, 2, 1, 0, 4, 1, 2, 0, 2, 1, 0, 0, 0, 3, 2, 2, 0, 0, 0, 2, 0, 0, 0, 0, 2, 2, 1, 1, 0, 0, 2, 4, 0, 1, 4, 2, 2, 0, 0, 2, 3, 1, 0, 0, 0, 0, 0, 0, 0, 3, 0, 2, 2, 2, 0, 0, 0, 0, 5

Offset: 1

N. J. A. Sloane

Coefficients of Dedekind zeta function for the quadratic number field of discriminant 28. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

Amiram Eldar, Table of n, a(n) for n = 1..10000

Dedekind zeta functions for imaginary quadratic number fields of discriminants -3, -4, -7, -8, -11, -15, -19, -20 are A002324, A002654, A035182, A002325, A035179, A035175, A035171, A035170, respectively.
Dedekind zeta functions for real quadratic number fields of discriminants 5, 8, 12, 13, 17, 21, 24, 28, 29, 33, 37, 40 are A035187, A035185, A035194, A035195, A035199, A035203, A035188, A035210, A035211, A035215, A035219, A035192, respectively.
Cf. A003632, A296934.

a[n_] := DivisorSum[n, KroneckerSymbol[28, #] &]; Array[a, 100] (* Amiram Eldar, Nov 19 2023 *)

my(m = 28); direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))

a(n) = sumdiv(n, d, kronecker(28, d)); \\ Amiram Eldar, Nov 19 2023

From Amiram Eldar, Nov 19 2023: (Start)
a(n) = Sum_{d|n} Kronecker(28, d).
Multiplicative with a(p^e) = 1 if Kronecker(28, p) = 0 (p = 2 or 7), a(p^e) = (1+(-1)^e)/2 if Kronecker(28, p) = -1 (p is in A003632), and a(p^e) = e+1 if Kronecker(28, p) = 1 (p is in A296934).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = log(3*sqrt(7)+8)/sqrt(7) = 1.046454884756... . (End)

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

Original entry on oeis.org

1, 0, 0, 1, 2, 0, 2, 0, 1, 0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 2, 0, 0, 2, 0, 3, 0, 0, 2, 1, 0, 0, 0, 0, 0, 4, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 2, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 1, 4, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1

Offset: 1

N. J. A. Sloane

Coefficients of Dedekind zeta function for the quadratic number field of discriminant 29. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

Amiram Eldar, Table of n, a(n) for n = 1..10000

Dedekind zeta functions for imaginary quadratic number fields of discriminants -3, -4, -7, -8, -11, -15, -19, -20 are A002324, A002654, A035182, A002325, A035179, A035175, A035171, A035170, respectively.
Dedekind zeta functions for real quadratic number fields of discriminants 5, 8, 12, 13, 17, 21, 24, 28, 29, 33, 37, 40 are A035187, A035185, A035194, A035195, A035199, A035203, A035188, A035210, A035211, A035215, A035219, A035192, respectively.
Cf. A038902, A191022.

a[n_] := DivisorSum[n, KroneckerSymbol[29, #] &]; Array[a, 100] (* Amiram Eldar, Nov 19 2023 *)

my(m = 29); direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))

a(n) = sumdiv(n, d, kronecker(29, d)); \\ Amiram Eldar, Nov 19 2023

From Amiram Eldar, Nov 19 2023: (Start)
a(n) = Sum_{d|n} Kronecker(29, d).
Multiplicative with a(29^e) = 1, a(p^e) = (1+(-1)^e)/2 if Kronecker(29, p) = -1 (p is in A038902), and a(p^e) = e+1 if Kronecker(29, p) = 1 (p is in A191022).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2*log((sqrt(29)+5)/2)/sqrt(29) = 0.611766289562... . (End)

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

Original entry on oeis.org

1, 0, 2, 1, 0, 0, 2, 0, 3, 0, 2, 2, 0, 0, 0, 1, 0, 0, 0, 0, 4, 0, 0, 0, 1, 0, 4, 2, 0, 0, 0, 0, 4, 0, 0, 3, 1, 0, 0, 0, 2, 0, 0, 2, 0, 0, 2, 2, 3, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 1, 0, 0, 2, 0, 0, 0, 2, 0, 2, 0, 2, 0, 4, 0, 0, 0, 5

Offset: 1

N. J. A. Sloane

Coefficients of Dedekind zeta function for the quadratic number field of discriminant 37. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

Amiram Eldar, Table of n, a(n) for n = 1..10000

Dedekind zeta functions for imaginary quadratic number fields of discriminants -3, -4, -7, -8, -11, -15, -19, -20 are A002324, A002654, A035182, A002325, A035179, A035175, A035171, A035170, respectively.
Dedekind zeta functions for real quadratic number fields of discriminants 5, 8, 12, 13, 17, 21, 24, 28, 29, 33, 37, 40 are A035187, A035185, A035194, A035195, A035199, A035203, A035188, A035210, A035211, A035215, A035219, A035192, respectively.
Cf. A038914, A191027.

a[n_] := DivisorSum[n, KroneckerSymbol[37, #] &]; Array[a, 100] (* Amiram Eldar, Nov 20 2023 *)

my(m = 37); direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))

a(n) = sumdiv(n, d, kronecker(37, d)); \\ Amiram Eldar, Nov 20 2023

From Amiram Eldar, Nov 20 2023: (Start)
a(n) = Sum_{d|n} Kronecker(37, d).
Multiplicative with a(37^e) = 1, a(p^e) = (1+(-1)^e)/2 if Kronecker(37, p) = -1 (p is in A038914), and a(p^e) = e+1 if Kronecker(37, p) = 1 (p is in A191027).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2*log(sqrt(37)+6)/sqrt(37) = 0.819292168725... . (End)

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

Original entry on oeis.org

1, 2, 1, 3, 0, 2, 0, 4, 1, 0, 1, 3, 0, 0, 0, 5, 2, 2, 0, 0, 0, 2, 0, 4, 1, 0, 1, 0, 2, 0, 2, 6, 1, 4, 0, 3, 2, 0, 0, 0, 2, 0, 0, 3, 0, 0, 0, 5, 1, 2, 2, 0, 0, 2, 0, 0, 0, 4, 0, 0, 0, 4, 0, 7, 0, 2, 2, 6, 0, 0, 0, 4, 0, 4, 1, 0, 0, 0, 0, 0, 1

Offset: 1

N. J. A. Sloane

Coefficients of Dedekind zeta function for the quadratic number field of discriminant 33. See A002324 for formula and Maple code. - N. J. A. Sloane, Mar 22 2022

Amiram Eldar, Table of n, a(n) for n = 1..10000

Dedekind zeta functions for imaginary quadratic number fields of discriminants -3, -4, -7, -8, -11, -15, -19, -20 are A002324, A002654, A035182, A002325, A035179, A035175, A035171, A035170, respectively.
Dedekind zeta functions for real quadratic number fields of discriminants 5, 8, 12, 13, 17, 21, 24, 28, 29, 33, 37, 40 are A035187, A035185, A035194, A035195, A035199, A035203, A035188, A035210, A035211, A035215, A035219, A035192, respectively.
Cf. A038907, A038908.

a[n_] := DivisorSum[n, KroneckerSymbol[33, #] &]; Array[a, 100] (* Amiram Eldar, Nov 19 2023 *)

my(m = 33); direuler(p=2,101,1/(1-(kronecker(m,p)*(X-X^2))-X))

a(n) = sumdiv(n, d, kronecker(33, d)); \\ Amiram Eldar, Nov 19 2023

From Amiram Eldar, Nov 19 2023: (Start)
a(n) = Sum_{d|n} Kronecker(33, d).
Multiplicative with a(p^e) = 1 if Kronecker(33, p) = 0 (p = 3 or 11), a(p^e) = (1+(-1)^e)/2 if Kronecker(33, p) = -1 (p is in A038908), and a(p^e) = e+1 if Kronecker(33, p) = 1 (p is in A038907 \ {3, 11}).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2*log(4*sqrt(33)+23)/sqrt(33) = 1.332797188186... . (End)

A050470 a(n) = Sum_{d|n, n/d == 1 (mod 4)} d^2 - Sum_{d|n, n/d == 3 (mod 4)} d^2.

Original entry on oeis.org

1, 4, 8, 16, 26, 32, 48, 64, 73, 104, 120, 128, 170, 192, 208, 256, 290, 292, 360, 416, 384, 480, 528, 512, 651, 680, 656, 768, 842, 832, 960, 1024, 960, 1160, 1248, 1168, 1370, 1440, 1360, 1664, 1682, 1536, 1848, 1920, 1898, 2112, 2208, 2048, 2353, 2604

Offset: 1

N. J. A. Sloane, Dec 23 1999

Number 7 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).
Multiplicative because it is the Dirichlet convolution of A000290 = n^2 and A101455 = [1 0 -1 0 1 0 -1 ...], which are both multiplicative. - Christian G. Bower, May 17 2005

			G.f. = q + 4*q^2 + 8*q^3 + 16*q^4 + 26*q^5 + 32*q^6 + 48*q^7 + 64*q^8 + ...

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
J. W. L. Glaisher, On the representations of a number as the sum of two, four, six, eight, ten, and twelve squares, Quart. J. Math. 38 (1907), 1-62 (see p. 4 and p. 8).
Yves Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc. 348 (1996), no. 12, 4825-4856, see page 4852 Table I.
Michael Somos, Index to Yves Martin's list of 74 multiplicative eta-quotients and their A-numbers, 2016.
Michael Somos, Introduction to Ramanujan theta functions, 2019.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions.
Index entries for sequences mentioned by Glaisher.

Cf. A050461, A050465, A101455, A120030, A153071.
Cf. A027750, A000122, A000700, A010054, A121373.
Glaisher's E'_i (i=0..12): A002654, A050469, this sequence, A050471, A050468, A321829, A321830, A321831, A321832, A321833, A321834, A321835, A321836.

a050470 n = a050461 n - a050465 n  -- Reinhard Zumkeller, Mar 06 2012

Basis( ModularForms( Gamma1(4), 3), 51) [2]; /* Michael Somos, May 17 2015 */

a[ n_] := SeriesCoefficient[ q (QPochhammer[ q^2]^3 (QPochhammer[ q^4] / QPochhammer[ q])^2)^2, {q, 0, n}]; (* Michael Somos, May 17 2015 *)
a[ n_] := SeriesCoefficient[ (EllipticTheta[ 3, 0, q] EllipticTheta[ 2, 0, q]^2 / 4)^2, {q, 0, n}]; (* Michael Somos, May 17 2015 *)
a[ n_] := If[ n < 1, 0, Sum[ d^2 Mod[n/d, 2] (-1)^Quotient[n/d, 2], {d, Divisors@n}]]; (* Michael Somos, May 17 2015 *)
s[n_] := If[OddQ[n], (-1)^((n-1)/2), 0]; (* A101455 *)
f[p_, e_] := (p^(2*e+2) - s[p]^(e+1))/(p^2 - s[p]); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Nov 04 2023 *)

{a(n) = if( n<1, 0, sumdiv( n, d, d^2 * (n/d%2) * (-1)^(n/d\2)))};

{a(n) = my(A); if( n<1, 0, n--; A = x * O(x^n); polcoeff( eta(x^2 + A)^6 * (eta(x^4 + A) / eta(x + A))^4, n))}; /* Michael Somos, May 17 2015 */

from math import prod
from sympy import factorint
def A050470(n): return prod((p**(e+1<<1)-(m:=(0,1,0,-1)[p&3]))//(p**2-m) for p, e in factorint(n).items()) # Chai Wah Wu, Jun 21 2024

G.f.: Sum_{n>=1} n^2*x^n/(1+x^(2*n)). - Vladeta Jovovic, Oct 16 2002
From Michael Somos, Aug 08 2005: (Start)
Euler transform of period 4 sequence [ 4, -2, 4, -6, ...].
Expansion of eta(q^2)^6 * eta(q^4)^4 / eta(q)^4 in powers of q.
G.f.: x Product_{k>0} (1 + x^k)^4 * (1 - x^(2*k))^2 * (1 - x^(4*k))^4.
G.f. A(x) satisfies 0 = f(A(x), A(x^2), A(x^4)) where f(u, v, w) = u*w * (u - 8*v) * (v - 4*w) - v^2 * (v - 8*w)^2. (End)
G.f.: Sum_{k>0} Kronecker(-4, k) * x^k * (1 + x^k) / (1 - x^k)^3. - Michael Somos, Sep 02 2005
Expansion of q * phi(q)^2 * psi(q^2)^4 in powers of q where phi(), psi() are Ramanujan theta functions. - Michael Somos, Aug 15 2007
G.f. is a period 1 Fourier series which satisfies f(-1 / (4 t)) = (1/2) (t/i)^3 g(t) where q = exp(2 Pi i t) and g() is the g.f. for A120030.
a(n) = A050461(n) - A050465(n). - Reinhard Zumkeller, Mar 06 2012
Multiplicative with a(p^e) = ((p^2)^(e+1) - Chi(p)^(e+1))/(p^2 - Chi(p)), Chi = A101455. - Jianing Song, Oct 30 2019
Sum_{k=1..n} a(k) ~ c * n^3 / 3, where c = Pi^3/32 (A153071). - Amiram Eldar, Nov 04 2023
a(n) = Sum_{d|n} (n/d)^2*sin(d*Pi/2). - Ridouane Oudra, Sep 26 2024

A145393 Number of inequivalent sublattices of index n in square lattice, where two sublattices are considered equivalent if one can be rotated or reflected to give the other, with that rotation or reflection preserving the parent square lattice.

Original entry on oeis.org

1, 2, 2, 4, 3, 5, 3, 7, 5, 7, 4, 11, 5, 8, 8, 12, 6, 13, 6, 15, 10, 11, 7, 21, 10, 13, 12, 18, 9, 22, 9, 21, 14, 16, 14, 29, 11, 17, 16, 29, 12, 28, 12, 25, 23, 20, 13, 39, 16, 27, 20, 29, 15, 34, 20, 36, 22, 25, 16, 50, 17, 26, 29, 38, 24, 40, 18, 36, 26, 40

Offset: 1

N. J. A. Sloane, Feb 23 2009

nonn

From Andrey Zabolotskiy, Mar 12 2018: (Start)
If reflections are not allowed, we get A145392. If any rotations and reflections are allowed, we get A054346.
The parent lattice of the sublattices under consideration has Patterson symmetry group p4mm, and two sublattices are considered equivalent if they are related via a symmetry from that group [Rutherford]. For other 2D Patterson groups, the analogous sequences are A000203 (p2), A069734 (p2mm), A145391 (c2mm), A145392 (p4), A145394 (p6), A003051 (p6mm).
Rutherford says at p. 161 that a(n) != A054346(n) only when A002654(n) > 2, but actually these two sequence differ at other terms, too, for example, at n = 30 (see illustration). (End)

Andrey Zabolotskiy, Table of n, a(n) for n = 1..10000
Amihay Hanany, Domenico Orlando, and Susanne Reffert, Sublattice counting and orbifolds, High Energ. Phys., 2010 (2010), 51, arXiv.org:1002.2981 [hep-th] (see table 6 and fig. 2).
John S. Rutherford, Sublattice enumeration. IV. Equivalence classes of plane sublattices by parent Patterson symmetry and colour lattice group type, Acta Cryst. (2009). A65, 156-163. [See Table 2; beware the typo in a(5).]
Andrey Zabolotskiy, Sublattices of the square lattice (illustrations for n = 1..6, 15, 25)
Index entries for sequences related to sublattices
Index entries for sequences related to square lattice

Cf. A054345, A054346, A167156, A008621.
Cf. A000203, A069734, A145391, A145392, A145394, A003051, A002324, A002654, A069735, A145390.
Cf. A019590, A157228, A157226, A157230, A157231, A053866, A025441.

terms = 70;
CoefficientList[Sum[(1/((1-x^m)(1-x^(4m)))-1), {m, 1, terms}] + O[x]^(terms + 1), x] // Rest (* Jean-François Alcover, Aug 05 2018 *)

a(n) = (A000203(n) + A002654(n) + A069735(n) + A145390(n))/4. [Rutherford] - N. J. A. Sloane, Mar 13 2009
G.f.: Sum_{ m>=1 } (1/((1-x^m)(1-x^(4m))) - 1). [Hanany, Orlando & Reffert, eq. (6.8)] - Andrey Zabolotskiy, Jul 05 2017
a(n) = Sum_{ m: m^2|n } A019590(n/m^2) + A157228(n/m^2) + A157226(n/m^2) + A157230(n/m^2) + A157231(n/m^2) = A053866(n) + A025441(n) + Sum_{ m: m^2|n } A157226(n/m^2) + A157230(n/m^2) + A157231(n/m^2). [Rutherford] - Andrey Zabolotskiy, May 07 2018
a(n) = Sum_{ d|n } A008621(d) = Sum_{ d|n } (1 + floor(d/4)). [From the above-given g.f.] - Andrey Zabolotskiy, Jul 17 2019

New name from Andrey Zabolotskiy, Mar 12 2018

A050468 a(n) = Sum_{d|n, n/d=1 mod 4} d^4 - Sum_{d|n, n/d=3 mod 4} d^4.

Original entry on oeis.org

1, 16, 80, 256, 626, 1280, 2400, 4096, 6481, 10016, 14640, 20480, 28562, 38400, 50080, 65536, 83522, 103696, 130320, 160256, 192000, 234240, 279840, 327680, 391251, 456992, 524960, 614400, 707282, 801280, 923520, 1048576, 1171200

Offset: 1

N. J. A. Sloane, Dec 23 1999

Multiplicative because it is the Dirichlet convolution of A000583 = n^4 and A101455 = [1 0 -1 0 1 0 -1 ...], which are both multiplicative. - Christian G. Bower, May 17 2005
Called E'_4(n) by Hardy.
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

			G.f. = x + 16*x^2 + 80*x^3 + 256*x^4 + 626*x^5 + 1280*x^6 + 2400*x^7 + 4096*x^8 + ...

Emil Grosswald, Representations of Integers as Sums of Squares, Springer-Verlag, NY, 1985, p. 120.
G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, Chelsea Publishing Company, New York 1959, p. 135, section 9.3. MR0106147 (21 #4881)

Seiichi Manyama, Table of n, a(n) for n = 1..10000
J. W. L. Glaisher, On the representations of a number as the sum of two, four, six, eight, ten, and twelve squares, Quart. J. Math. 38 (1907), 1-62 (see p. 4 and p. 8).
Michael Somos, Introduction to Ramanujan theta functions, 2019.
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions.
Index entries for sequences mentioned by Glaisher.

Cf. A000122, A000583, A000700, A010054, A101455, A121373, A175571, A204342, A204372.

Glaisher's E'_i (i=0..12): A002654, A050469, A050470, A050471, this sequence, A321829, A321830, A321831, A321832, A321833, A321834, A321835, A321836.

A := Basis( ModularForms( Gamma1(4), 5), 34); A[2] + 16*A[3]; /* Michael Somos, May 03 2015 */

edashed[r_,n_] := Plus@@(Select[Divisors[n], Mod[n/#,4] == 1 &]^r) - Plus@@(Select[Divisors[n], Mod[n/#,4] == 3 &]^r); edashed[4,#] &/@Range[33] (* Ant King, Nov 10 2012 *)
a[ n_] := SeriesCoefficient[ EllipticTheta[ 3, 0, x^2] (EllipticTheta[ 2, 0, x]^8 + 4 EllipticTheta[ 2, 0, x^2]^8) / 256, {x, 0, 2 n}]; (* Michael Somos, Jan 11 2015 *)
s[n_] := If[OddQ[n], (-1)^((n-1)/2), 0]; (* A101455 *)
f[p_, e_] := (p^(4*e+4) - s[p]^(e+1))/(p^4 - s[p]); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Nov 04 2023 *)

{a(n) = if( n<1, 0, sumdiv( n, d, (n/d%2) * (-1)^((n/d - 1)/2) * d^4))}; /* Michael Somos, Sep 12 2005 */

{a(n) = if( n<1, 0, sumdiv( n, d, d^4 * kronecker( -4, n\d)))}; /* Michael Somos, Jan 14 2012 */

{a(n) = my(A); if( n<1, 0, n--; A = x * O(x^n); polcoeff( eta(x^2 + A)^2 * eta(x^4 + A)^4 * (eta(x + A)^4 + 20 * x * eta(x^4 + A)^8 / eta(x + A)^4), n))}; /* Michael Somos, Jan 14 2012 */

a(2*n + 1) = A204342(n). a(2*n) = 16 * a(n).
G.f.: Sum_{n>=1} n^4*x^n/(1+x^(2*n)). - Vladeta Jovovic, Oct 16 2002
From Michael Somos, Jan 14 2012: (Start)
Expansion of eta(q^2)^2 * eta(q^4)^4 * (eta(q)^4 + 20 * eta(q^4)^8 / eta(q)^4) in powers of q.
a(n) is multiplicative with a(2^e) = 16^e, a(p^e) = ((p^4)^(e+1) - 1) / (p^4 - 1) if p == 1 (mod 4), a(p^e) = ((p^4)^(e+1) - (-1)^(e+1)) / (p^4 + 1) if p == 3 (mod 4). (End)
From Michael Somos, Jan 15 2012: (Start)
Expansion of theta_3(q^2) * (theta_2(q)^8 + 4 * theta_2(q^2)^8) / 256 in powers of q^2.
Expansion of x * phi(x)^2 * (psi(x)^8 + 4 * x * psi(x^2)^8) in powers of x where phi(), psi() are Ramanujan theta functions. (End)
G.f. is a period 1 Fourier series which satisfies f(-1 / (4 t)) = (1/2) (t/i)^5 g(t) where q = exp(2 Pi i t) and g(t) is the g.f. for A204372. - Michael Somos, May 03 2015
From Amiram Eldar, Nov 04 2023: (Start)
Multiplicative with a(p^e) = (p^(4*e+4) - A101455(p)^(e+1))/(p^4 - A101455(p)).
Sum_{k=1..n} a(k) ~ c * n^5 / 5, where c = 5*Pi^5/1536 (A175571). (End)
a(n) = Sum_{d|n} (n/d)^4*sin(d*Pi/2). - Ridouane Oudra, Sep 27 2024

cp's OEIS Frontend

A052343 Number of ways to write n as the unordered sum of two triangular numbers (zero allowed).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

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

Views

Author

Keywords

Comments

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

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

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

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

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

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