The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A002752 a(n) = Fibonacci(n-1) mod n. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
MATHEMATICA
Table[Mod[Fibonacci[n], n+1], {n, 6!}] (* Vladimir Joseph Stephan Orlovsky, Feb 18 2010 *)
PROG
(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
(PARI) a(n) = fibonacci(n-1) % n; \\ Michel Marcus, Apr 11 2022
CROSSREFS
Column 0 of A352747.
Sequence in context: A016587 A123217 A039704 * A239693 A256655 A128047
KEYWORD
nonn
AUTHOR
John C. Hallyburton, Jr. (hallyb(AT)evms.ENET.dec.com)
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 June 7 12:16 EDT 2024. Contains 373173 sequences. (Running on oeis4.)