OFFSET
1,2
COMMENTS
Let L_a(s) = Sum_{k>=0} (-a|2k+1) /(2k+1)^s be a Dirichlet series, where (-a|2k+1) is the Jacobi symbol. Then the c_(a,n) are defined by L_a(2n+1) = (Pi/(2a))^(2n+1)*sqrt(a)*c_(a,n)/(2n)! for n=0,1,2,..., a=1,2,3,...
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Matthew House, Table of n, a(n) for n = 1..10000
D. Shanks, Generalized Euler and class numbers. Math. Comp. 21 (1967) 689-694.
D. Shanks, Corrigendum: Generalized Euler and class numbers. Math. Comp. 22, (1968) 699.
D. Shanks, Generalized Euler and class numbers, Math. Comp. 21 (1967), 689-694; 22 (1968), 699. [Annotated scanned copy]
MATHEMATICA
amax = 50; nmax = 1; km0 = 10; Clear[cc]; L[a_, s_, km_] := Sum[ JacobiSymbol[-a, 2 k + 1]/(2 k + 1)^s, {k, 0, km}]; c[1, n_, km_] := 2 (2 n)! L[1, 2 n + 1, km] (2/Pi)^(2 n + 1) // Round; c[a_ /; a > 1, n_, km_] := (2 n)! L[a, 2 n + 1, km] (2 a/Pi)^(2 n + 1)/Sqrt[a] // Round; cc[km_] := cc[km] = Table[c[a, n, km], {a, 1, amax}, {n, 0, nmax}]; cc[km0]; cc[ km = 2 km0]; While[cc[km] != cc[km/2, km = 2 km]]; A000233 = cc[km][[All, 2]] (* Jean-François Alcover, Feb 06 2016 *)
Table[rowA235605[n, 1][[2]], {n, 50}] (* see A235605 *) (* Matthew House, Oct 05 2024 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Jun 02 2000
Name clarified by James C. McMahon, Nov 30 2023
STATUS
approved