Location via proxy:   [ UP ]   [Report a bug]   [Manage cookies]    No cookies    No scripts    No ads    No referrer    Show this form

login

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

 

Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!) A090629 a(n) = abs(numerator of 2n-th Bernoulli number) modulo 3. 0 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format) OFFSET 0,6 LINKS Table of n, a(n) for n=0..104. FORMULA a(n) = abs(A000367(n)) (mod 3) MATHEMATICA Mod[Abs[Numerator[BernoulliB[2*Range[0, 120]]]], 3] (* Harvey P. Dale, Nov 16 2021 *) PROG (PARI) a(n)=abs(numerator(bernfrac(2*n)))%3 CROSSREFS Sequence in context: A319907 A357112 A078703 * A248623 A086412 A192006 Adjacent sequences: A090626 A090627 A090628 * A090630 A090631 A090632 KEYWORD nonn AUTHOR Benoit Cloitre, Dec 13 2003 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 August 18 23:05 EDT 2024. Contains 375284 sequences. (Running on oeis4.)