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!)
A133891 a(n) = binomial(n+p,n) mod p, where p=12. 0
1, 1, 7, 11, 8, 8, 0, 0, 6, 2, 2, 2, 4, 4, 4, 0, 3, 3, 9, 9, 0, 0, 0, 0, 0, 0, 0, 4, 4, 4, 8, 8, 5, 9, 3, 3, 8, 8, 8, 4, 10, 10, 6, 6, 0, 0, 0, 0, 3, 3, 9, 9, 0, 0, 4, 4, 4, 8, 8, 8, 0, 0, 0, 8, 5, 5, 7, 7, 4, 0, 0, 0, 6, 6, 6, 6, 0, 0, 0, 0, 3, 7, 1, 1, 8, 8, 8, 0, 0, 0, 8, 8, 8, 4, 4, 4, 9, 9, 3, 3, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Periodic with length 6*12^2 = 864 = A133900(12).
LINKS
FORMULA
a(n) = binomial(n+12,12) mod 12.
MATHEMATICA
Table[Mod[Binomial[n+12, n], 12], {n, 0, 110}] (* Harvey P. Dale, Oct 13 2017 *)
CROSSREFS
See A133872, A133873, A133875, A133877, A133884, A133886, A133888, A133889, A133890 for sequences with different values of p.
See A133900 for the respective periods regarding other values of p.
Sequence in context: A228954 A283651 A358721 * A071631 A054510 A134702
KEYWORD
nonn
AUTHOR
Hieronymus Fischer, Oct 16 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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)