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!)
A329491 Dirichlet g.f.: Sum_{n>=0} a(n+1)/(1+10n)^s = Product ((1+p^(-s))/(1-p^(-s))) (p==1 mod 5). 0
1, 2, 0, 2, 2, 0, 2, 2, 0, 0, 2, 0, 2, 2, 0, 2, 0, 0, 2, 2, 0, 2, 0, 0, 2, 2, 0, 2, 2, 0, 0, 2, 0, 2, 4, 0, 0, 0, 0, 0, 2, 0, 2, 2, 0, 4, 2, 0, 0, 2, 0, 0, 2, 0, 2, 0, 0, 2, 0, 0, 2, 0, 0, 2, 2, 0, 2, 4, 0, 2, 2, 0, 0, 0, 0, 2, 2, 0, 4, 0, 0, 2, 2, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
If the D.g.f. is squared we get A031362.
LINKS
PROG
(PARI)
t4=direuler(p=2, M, (1+(p%5<2)*X)) \\ p == 0 or 1 mod 5
t5=direuler(p=2, M, 1/(1+(p%5<1)*X)) \\ p == 0 mod 5
t6=dirmul(t4, t5) \\ p == 1 mod 5
t7=direuler(p=2, M, 1/(1-(p%5<2)*X))
t8=direuler(p=2, M, (1-(p%5<1)*X))
t9=dirmul(t7, t8)
t10=dirmul(t6, t9)
t11=vector(100, n, t10[10*n+1]) \\ (and then prepend 1)
CROSSREFS
Cf. A031362.
Sequence in context: A123530 A161516 A347730 * A123063 A031358 A279103
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 15 2019.
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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)