cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A132633 #10 Apr 11 2022 12:18:59
%S A132633 1,6,36,48,125,36,392,384,972,750,1210,144,1183,1176,4500,3072,2601,
%T A132633 972,6498,6000,3528,3630,12696,1152,15625,7098,26244,2352,11774,4500,
%U A132633 28830,24576,21780,5202,49000,3888,26011,6498,42588,48000,33620,3528,81356
%N A132633 Minimal m > 0 such that Fibonacci(m) == 0 (mod n^3).
%C A132633 a(n) is a divisor of the Pisano period A001175(n^3).
%F A132633 a(n) = A001177(n^3)
%e A132633 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 A132633 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 A132633 Cf. A000045, A001175, A001177, A130233, A130234, A131294.
%K A132633 nonn
%O A132633 1,2
%A A132633 _Hieronymus Fischer_, Aug 24 2007