login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002708 a(n) = Fibonacci(n) mod n. 15
0, 1, 2, 3, 0, 2, 6, 5, 7, 5, 1, 0, 12, 13, 10, 11, 16, 10, 1, 5, 5, 1, 22, 0, 0, 25, 20, 11, 1, 20, 1, 5, 13, 33, 30, 0, 36, 1, 37, 35, 1, 34, 42, 25, 20, 45, 46, 0, 36, 25, 32, 23, 52, 8, 5, 21, 40, 1, 1, 0, 1, 1, 43, 59, 60, 52, 66, 65, 44, 15, 1, 0, 72, 73, 50, 3, 2, 44, 1, 5, 7, 1, 82, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

REFERENCES

S. Wolfram, A New Kind of Science, Wolfram Media, 2002, p. 891.

LINKS

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

E. Lucas, Théorie des nombres (annotated scans of a few selected pages)

MAPLE

with(combinat): [ seq( fibonacci(n) mod n, n=1..80) ];

MATHEMATICA

Table[Mod[Fibonacci[n], n], {n, 1, 100}] (* Stefan Steinerberger, Apr 18 2006 *)

PROG

(MAGMA) [Fibonacci(n) mod n : n in [1..120]]; // Vincenzo Librandi, Nov 19 2015

(Python)

A002708_list, a, b, = [], 1, 1

for n in range(1, 10**4+1):

    A002708_list.append(a%n)

    a, b = b, a+b # Chai Wah Wu, Nov 26 2015

(PARI) a(n) = fibonacci(n) % n; \\ Michel Marcus, May 11 2016

CROSSREFS

Cf. A002726, A002752, A023172 (indices of 0's), A023173 (indices of 1's), A023174-A023182.

Cf. A263101.

Sequence in context: A194745 A248342 A002392 * A167925 A209927 A059283

Adjacent sequences:  A002705 A002706 A002707 * A002709 A002710 A002711

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

More terms from Stefan Steinerberger, Apr 18 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 29 19:01 EDT 2016. Contains 273510 sequences.