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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133890 Binomial(n+10,n) mod 10. 59
1, 1, 6, 6, 1, 3, 8, 8, 8, 8, 6, 6, 6, 6, 6, 0, 5, 5, 0, 0, 5, 5, 0, 0, 0, 6, 6, 6, 6, 6, 8, 8, 3, 3, 8, 6, 1, 1, 6, 6, 0, 0, 0, 0, 0, 0, 0, 0, 5, 5, 6, 6, 1, 1, 6, 8, 8, 8, 8, 8, 6, 6, 6, 6, 1, 5, 0, 0, 5, 5, 0, 0, 0, 0, 0, 6, 6, 6, 6, 6, 3, 3, 8, 8, 3, 1, 6, 6, 6, 6, 0, 0, 0, 0, 0, 0, 5, 5, 0, 0, 1, 1, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Periodic with length A133900(10)=4*10^2=400.
LINKS
FORMULA
a(n) = binomial(n+10,10) mod 10.
MATHEMATICA
Table[Mod[Binomial[10+n, n], 10], {n, 0, 120}] (* Harvey P. Dale, Sep 19 2018 *)
PROG
(PARI) a(n)=binomial(n+10, 10)%10 \\ Charles R Greathouse IV, Nov 22 2011
CROSSREFS
Sequence in context: A176567 A283100 A065493 * A248059 A111719 A228918
KEYWORD
nonn,easy
AUTHOR
Hieronymus Fischer, Oct 10 2007
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 April 25 11:21 EDT 2024. Contains 371967 sequences. (Running on oeis4.)