login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A328999 Dirichlet g.f. = Product_{primes p == 1 (mod 12)} (1+p^(-s))^2/(1-p^(-s))^2) * Product_{primes p == +-5 (mod 12)} (1+p^(-2*s))/(1-p^(-2*s). 0
1, 4, 2, 4, 2, 4, 4, 0, 4, 4, 0, 0, 0, 4, 8, 4, 4, 0, 0, 4, 4, 0, 0, 4, 2, 0, 4, 8, 4, 4, 2, 4, 0, 4, 4, 4, 4, 0, 4, 0, 16, 0, 0, 0, 0, 4, 0, 0, 4, 0, 4, 4, 2, 8, 0, 4, 4, 0, 0, 4, 0, 4, 0, 4, 4, 0, 16, 0, 0, 4, 2, 4, 0, 4, 0, 0, 0, 8, 4, 16, 2, 0, 0, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
Michael Baake and Peter A. B. Pleasants, Algebraic solution of the coincidence problem in two and three dimensions, Zeitschrift für Naturforschung A 50.8 (1995): 711-717. See page 714.
EXAMPLE
The D.g.f. is 1 + 4/13^s + 2/25^s + 4/37^s + ... .
PROG
(PARI) a(n) = direuler(p = 2, 12*n-11, (1 + (p%12==1)*X)^2/(1 - (p%12==1)*X)^2 * (1 + ((p%12==5)+(p%12==7))*X^2)/(1 - ((p%12==5)+(p%12==7))*X^2))[12*n-11]; \\ Amiram Eldar, May 11 2024
CROSSREFS
Sequence in context: A209272 A105397 A373422 * A236185 A300004 A147973
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 14 2019
EXTENSIONS
More terms from Amiram Eldar, May 11 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 09:01 EDT 2024. Contains 374318 sequences. (Running on oeis4.)