This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A028253 n mod Fibonacci(n). 0
 0, 0, 1, 1, 0, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA a(n) = n for n>5. G.f.: -x^3*(5*x^4-7*x^3+x^2+x-1) / (x-1)^2. - Colin Barker, Aug 05 2013 MAPLE with(combinat): [ seq( n mod fibonacci(n), n=1..80) ]; MATHEMATICA Table[Mod[n, Fibonacci[n]], {n, 60}] (* or *) LinearRecurrence[{2, -1}, {0, 0, 1, 1, 0, 6, 7}, 60] (* Harvey P. Dale, Jul 06 2019 *) PROG (PARI) a(n)=if(n>5, n, [0, 0, 1, 1, 0][n]) \\ Charles R Greathouse IV, Aug 22 2011 CROSSREFS Cf. A002708. Sequence in context: A114459 A168096 A030546 * A020715 A182307 A023384 Adjacent sequences:  A028250 A028251 A028252 * A028254 A028255 A028256 KEYWORD nonn,easy AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 17:41 EST 2019. Contains 329847 sequences. (Running on oeis4.)