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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105994 Fibonacci sequence (mod 13). 1
0, 1, 1, 2, 3, 5, 8, 0, 8, 8, 3, 11, 1, 12, 0, 12, 12, 11, 10, 8, 5, 0, 5, 5, 10, 2, 12, 1, 0, 1, 1, 2, 3, 5, 8, 0, 8, 8, 3, 11, 1, 12, 0, 12, 12, 11, 10, 8, 5, 0, 5, 5, 10, 2, 12, 1, 0, 1, 1, 2, 3, 5, 8, 0, 8, 8, 3, 11, 1, 12, 0, 12, 12, 11, 10, 8, 5, 0, 5, 5, 10, 2, 12, 1, 0, 1, 1, 2, 3, 5, 8, 0, 8, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Keith Johnson, and Kira Scheibelhut, Rational Polynomials That Take Integer Values at the Fibonacci Numbers, American Mathematical Monthly 123.4 (2016): 338-346. See p. 343.

EXAMPLE

Sequence is periodic with Pisano period 28.

MATHEMATICA

Table[Mod[Fibonacci[n], 13], {n, 0, 100}](* Vincenzo Librandi, Feb 04 2014 *)

PROG

(MAGMA) [Fibonacci(n) mod 13: n in [0..100]]; // Vincenzo Librandi, Feb 04 2014

(PARI) a(n) = fibonacci(n) % 13; \\ Michel Marcus, Oct 01 2017

CROSSREFS

Cf. A000045.

Sequence in context: A208361 A145380 A136740 * A120496 A105150 A008963

Adjacent sequences:  A105991 A105992 A105993 * A105995 A105996 A105997

KEYWORD

nonn,easy

AUTHOR

Shyam Sunder Gupta, May 05 2005

EXTENSIONS

a(0)=0 prepended by Vincenzo Librandi, Feb 04 2014

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 20 12:16 EST 2017. Contains 294964 sequences.