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

 


A084217
Number of k's 1<=k<=n dividing the numerator of 2n-th Bernoulli number.
1
1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 3, 2, 1, 2, 2, 1, 2, 1, 2, 2, 4, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 1, 3, 1, 2, 3, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 1, 4, 2, 2, 2, 2, 3, 2, 1, 2, 2, 3, 2, 4, 1, 2, 2, 1, 2, 2, 1, 4, 2, 2, 3, 2, 1, 4, 2, 2, 2, 5, 1, 2, 3, 2, 1
OFFSET
1,4
PROG
(PARI) a(n)=sum(k=1, n, if(numerator(bernfrac(2*n))%k, 0, 1))
CROSSREFS
Sequence in context: A227945 A003647 A353352 * A245548 A025903 A175327
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jun 21 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 20 12:37 EDT 2024. Contains 376072 sequences. (Running on oeis4.)