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 A235249 #30 Aug 11 2022 03:41:22 %S A235249 1,24,24,24,120,24,24,24,24,120,120,24,24,24,120,24,24,24,24,120,24, %T A235249 120,24,24,600,24,24,24,24,120,120,24,120,24,120,24,24,24,24,120,120, %U A235249 24,120,120,120,24,24,24,24,600,24,24,24,24,120,24,24,24,24,120 %N A235249 Fixed point when A001175 (Pisano periods) is iterated with starting value n. %C A235249 Are the powers of 5 (together with 2) the indices of records in this sequence? - _Charles R Greathouse IV_, Aug 11 2022 %H A235249 Reinhard Zumkeller, <a href="/A235249/b235249.txt">Table of n, a(n) for n = 1..10000</a> %H A235249 J. D. Fulton and W. L. Morris, <a href="http://matwbn.icm.edu.pl/ksiazki/aa/aa16/aa1621.pdf">On arithmetical functions related to the Fibonacci numbers</a>, Acta Arithmetica, 16 (1969), 105-110. %H A235249 Wikipedia, <a href="http://en.wikipedia.org/wiki/Pisano_period">Pisano period</a> %F A235249 a(n) = 24*5^(A001179(n)-1) for n > 1. %F A235249 A001175(a(n)) = a(n). %o A235249 (Haskell) %o A235249 a235249 n = if y == n then n else a235249 y where y = a001175 n %Y A235249 Cf. A001175, A001179. %K A235249 nonn %O A235249 1,2 %A A235249 _Reinhard Zumkeller_, Jan 15 2014