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!)
A023176 Numbers k such that Fibonacci(k) == 5 (mod k). 1

%I

%S 1,2,3,5,8,10,20,21,32,55,80,95,104,145,155,165,205,247,295,305,320,

%T 355,395,437,445,505,545,605,655,667,695,745,755,895,905,955,987,995,

%U 1055,1145,1195,1205,1255,1345,1355,1405,1435,1555,1615,1655,1705,1745,1795

%N Numbers k such that Fibonacci(k) == 5 (mod k).

%H Charles R Greathouse IV, <a href="/A023176/b023176.txt">Table of n, a(n) for n = 1..10000</a>

%o (PARI) is(n)=((Mod([1,1;1,0],n))^n)[1,2]==5 \\ _Charles R Greathouse IV_, May 29 2013

%Y Cf. A000045.

%K nonn

%O 1,2

%A _David W. Wilson_

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 January 23 07:35 EST 2022. Contains 350509 sequences. (Running on oeis4.)