login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023176 Numbers n such that Fibonacci(n) == 5 (mod n). 1
1, 2, 3, 5, 8, 10, 20, 21, 32, 55, 80, 95, 104, 145, 155, 165, 205, 247, 295, 305, 320, 355, 395, 437, 445, 505, 545, 605, 655, 667, 695, 745, 755, 895, 905, 955, 987, 995, 1055, 1145, 1195, 1205, 1255, 1345, 1355, 1405, 1435, 1555, 1615, 1655, 1705, 1745, 1795 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

PROG

(PARI) is(n)=((Mod([1, 1; 1, 0], n))^n)[1, 2]==5 \\ Charles R Greathouse IV, May 29 2013

CROSSREFS

Sequence in context: A122633 A004694 A309527 * A063178 A280205 A276731

Adjacent sequences:  A023173 A023174 A023175 * A023177 A023178 A023179

KEYWORD

nonn

AUTHOR

David W. Wilson

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 17:37 EDT 2020. Contains 334684 sequences. (Running on oeis4.)