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”).

A133889
a(n) = binomial(n+9,n) mod 9.
3
1, 1, 1, 4, 4, 4, 1, 1, 1, 2, 2, 2, 8, 8, 8, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 7, 7, 7, 4, 4, 4, 5, 5, 5, 2, 2, 2, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 1, 1, 1, 7, 7, 7, 8, 8, 8, 5, 5, 5, 8, 8, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 4, 4, 4, 1, 1, 1, 2, 2, 2, 8, 8, 8, 2, 2, 2, 3, 3, 3, 3, 3, 3
OFFSET
0,4
COMMENTS
Periodic with length 9^2 = 81.
LINKS
Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, -1, 1).
FORMULA
a(n) = binomial(n+9,9) mod 9.
MATHEMATICA
Table[Mod[Binomial[n+9, n], 9], {n, 0, 110}] (* Harvey P. Dale, Jan 14 2012 *)
KEYWORD
nonn
AUTHOR
Hieronymus Fischer, Oct 10 2007
STATUS
approved