The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 FORMULA a(n) = abs(A000367(n)) (mod 3) PROG (PARI) a(n)=abs(numerator(bernfrac(2*n)))%3 CROSSREFS Sequence in context: A250005 A319907 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 14 00:07 EDT 2021. Contains 342941 sequences. (Running on oeis4.)