A028253 n mod Fibonacci(n).

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

Offset

1,6

Links

Table of n, a(n) for n=1..57.

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}] (* Harvey P. Dale, Jul 06 2019 *)
(* Alternative: *)
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 A380486 A392343

Adjacent sequences: A028250 A028251 A028252 * A028254 A028255 A028256

Keyword

nonn,easy,changed

Author

N. J. A. Sloane

Status

approved