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!)
A132633 Minimal m > 0 such that Fibonacci(m) == 0 (mod n^3). 4

%I #10 Apr 11 2022 12:18:59

%S 1,6,36,48,125,36,392,384,972,750,1210,144,1183,1176,4500,3072,2601,

%T 972,6498,6000,3528,3630,12696,1152,15625,7098,26244,2352,11774,4500,

%U 28830,24576,21780,5202,49000,3888,26011,6498,42588,48000,33620,3528,81356

%N Minimal m > 0 such that Fibonacci(m) == 0 (mod n^3).

%C a(n) is a divisor of the Pisano period A001175(n^3).

%F a(n) = A001177(n^3)

%e a(6)=36, since Fib(36)=14930352==0(mod 6^3), but Fib(k) is not congruent to 0 modulo (6^3) for 1<=k<36.

%t Join[{1}, Table[a = {0, 1}; k = 0; While[k++; s = Mod[Plus @@ a, n^3]; a = RotateLeft[a]; a[[2]] = s; a[[1]] != 0]; k, {n, 2, 50}]] (* _T. D. Noe_, Aug 08 2012 *)

%Y Cf. A000045, A001175, A001177, A130233, A130234, A131294.

%K nonn

%O 1,2

%A _Hieronymus Fischer_, Aug 24 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 3 07:04 EDT 2024. Contains 372206 sequences. (Running on oeis4.)