login
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
OFFSET
0,6
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
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Dec 13 2003
STATUS
approved