[go: up one dir, main page]

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

A137290
Fibonacci(n) mod 30.
1
1, 1, 2, 3, 5, 8, 13, 21, 4, 25, 29, 24, 23, 17, 10, 27, 7, 4, 11, 15, 26, 11, 7, 18, 25, 13, 8, 21, 29, 20, 19, 9, 28, 7, 5, 12, 17, 29, 16, 15, 1, 16, 17, 3, 20, 23, 13, 6, 19, 25, 14, 9, 23, 2, 25, 27, 22, 19, 11, 0, 11, 11, 22, 3, 25, 28, 23, 21, 14, 5, 19, 24, 13, 7, 20, 27, 17, 14
OFFSET
1,3
COMMENTS
Has period 120.
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
MATHEMATICA
Mod[Fibonacci[Range[80]], 30] (* Harvey P. Dale, Sep 12 2022 *)
PROG
(PARI) a(n) = fibonacci(n) % 30 \\ Michel Marcus, Jun 12 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Aaron M. Churchill (churchil(AT)math.udel.edu), Mar 15 2008
STATUS
approved