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.
%I A132636 #21 Mar 08 2025 09:36:19
%S A132636 0,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,
%T A132636 1685,7063,4323,4896,12525,15937,19271,10483,2060,22040,5674,15621,
%U A132636 2752,3807,9340,432,46989,19305,11932,62155,31899,12088,22273,3677,32420
%N A132636 a(n) = Fibonacci(n) mod n^3.
%C A132636 a(1) = 0; for n=2 to 20, a(n) = A000045(n); otherwise for instance, see example. - _Michel Marcus_, Jul 15 2013
%H A132636 Charles R Greathouse IV, <a href="/A132636/b132636.txt">Table of n, a(n) for n = 1..10000</a>
%F A132636 a(n) = A000045(n) mod A000578(n).
%e A132636 a(21) = 1685, since Fibonacci(21) = 10946 == 1685 (mod 21^3).
%t A132636 Table[Mod[Fibonacci[n],n^3],{n,45}] (* _James C. McMahon_, Mar 08 2025 *)
%o A132636 (PARI) a(n) = fibonacci(n) % n^3 \\ _Michel Marcus_, Jul 15 2013
%o A132636 (PARI) a(n)=lift((Mod([1,1;1,0],n^3))^n)[1,2] \\ _Charles R Greathouse IV_, Jul 18 2013
%Y A132636 Cf. A000045, A000578, A023173.
%K A132636 nonn
%O A132636 1,3
%A A132636 _Hieronymus Fischer_, Aug 24 2007