A002752 a(n) = Fibonacci(n-1) mod n.

0, 1, 1, 2, 3, 5, 1, 5, 3, 4, 0, 5, 1, 9, 2, 2, 1, 13, 0, 1, 3, 12, 1, 1, 18, 15, 1, 26, 0, 29, 0, 29, 12, 2, 22, 17, 1, 1, 29, 26, 0, 13, 1, 13, 33, 2, 1, 1, 21, 49, 37, 18, 1, 23, 47, 13, 39, 30, 0, 41, 0, 1, 62, 34, 8, 49, 1, 5, 3, 54, 0, 1, 1, 39, 7, 2, 74

Offset: 1

Author

John C. Hallyburton, Jr. (hallyb(AT)evms.ENET.dec.com)

Keywords

• nonn

Links

• T. D. Noe, Table of n, a(n) for n=1..5000

Crossrefs

Column 0 of A352747.

Cf. A000045, A002708,

Programs

Mathematica

Table[Mod[Fibonacci[n],n+1],{n,6!}] (* Vladimir Joseph Stephan Orlovsky, Feb 18 2010 *)

PARI

a(n) = fibonacci(n-1) % n; \\ Michel Marcus, Apr 11 2022

Sage

def A002752(n): return mod(fibonacci(n - 1), n)
# Assuming offset 0 this prepends a(0) = 1.
print([A002752(n) for n in range(79)]) # Peter Luschny, Apr 11 2022