A318983 a(n) = Sum_{d|n} Kronecker(-163, d).

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

Offset

1,41

Comments

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

Half of the number of integer solutions 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)] counted up to association.

Inverse Moebius transform of A011615.

Links

Jianing Song, Table of n, a(n) for n = 1..10000

N. J. A. Sloane et al., Binary Quadratic Forms and OEIS.

Formula

a(n) is multiplicative with a(163^e) = 1, a(p^e) = (1 + (-1)^e) / 2 if Kronecker(-163, p) = -1, a(p^e) = e + 1 if Kronecker(-163, p) = 1.

G.f.: Sum_{k>0} Kronecker(-163, k) * x^k / (1 - x^k).

A318985(n) = 2 * a(n) unless n = 0.

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/sqrt(163) = 0.246068... . - Amiram Eldar, Dec 16 2023

Example

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

Mathematica

a[n_] := DivisorSum[n, KroneckerSymbol[-163, #] &]; Array[a, 100] (* Amiram Eldar, Dec 16 2023 *)

Prog

(PARI) a(n) = sumdiv(n, d, kronecker(-163, d))

Crossrefs

Cf. A318985.

Moebius transform gives A011615.

Number of integral elements with norm n in Q[sqrt(d)] counted up to association: A002324 (d=-3), A002654 (d=-4), A035182 (d=-7), A002325 (d=-8), A035179 (d=-11), A035171 (d=-19), A035147 (d=-43), A318982 (d=-67), this sequence (d=-163).

Sequence in context: A089800 A079208 A262682 * A318982 A069851 A197629

Adjacent sequences: A318980 A318981 A318982 * A318984 A318985 A318986

Keyword

nonn,easy,mult

Author

Jianing Song, Sep 06 2018

Status

approved