login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A090737
Triangle of Eulerian numbers modulo 3.
0
1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 0, 2, 1, 1, 0, 2, 2, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0, 1, 1, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 1, 1, 1, 0, 2, 2, 0, 0, 0, 0, 2, 2, 0, 1, 1
OFFSET
1,8
PROG
(PARI) T(n, k)=sum(j=0, k, (-1)^j*(k-j)^n*binomial(n+1, j))%3
CROSSREFS
Cf. A008292.
Sequence in context: A208183 A214810 A257248 * A204016 A343334 A157865
KEYWORD
nonn,tabl
AUTHOR
Benoit Cloitre, Jan 18 2004
STATUS
approved