The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A023174 Numbers k such that Fibonacci(k) == 2 (mod k). 2

%I

%S 1,3,6,77,93,123,143,213,237,267,453,483,573,597,627,717,723,813,843,

%T 933,1077,1203,1227,1293,1317,1347,1437,1517,1563,1707,1763,1797,1803,

%U 1893,1923,2157,2253,2283,2307,2427,2517,2643,2691,2733,2757,2787,2973,3021

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

%H Giovanni Resta, <a href="/A023174/b023174.txt">Table of n, a(n) for n = 1..10000</a>

%t Select[Range[3100],Mod[Fibonacci[#]-2,#]==0&] (* _Harvey P. Dale_, Sep 22 2021 *)

%o (PARI) is(n)=((Mod([1,1;1,0],n))^n)[1,2]==2 \\ _Charles R Greathouse IV_, Oct 28 2014

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

Last modified May 28 09:09 EDT 2022. Contains 354112 sequences. (Running on oeis4.)