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 A324907 #5 Apr 14 2019 17:22:52
%S A324907 1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,1,1,2,1,1,2,1,1,1,3,1,1,1,1,2,1,1,2,1,
%T A324907 3,2,1,1,2,1,1,2,1,1,3,1,1,1,4,3,2,1,1,1,3,1,2,1,1,2,1,1,3,1,3,2,1,1,
%U A324907 2,3,1,2,1,1,3,1,4,2,1,1,2,1,1,2,3,1,2,1,1,3,4,1,2,1,3,1,1,4,3,3,1,2,1,1,4
%N A324907 a(n) = A007895(A113175(n)).
%H A324907 Antti Karttunen, <a href="/A324907/b324907.txt">Table of n, a(n) for n = 1..17711</a>
%F A324907 a(n) = A007895(A113175(n)).
%F A324907 a(2n) = a(n).
%o A324907 (PARI)
%o A324907 A113175(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = fibonacci(f[i, 1])); factorback(f); };
%o A324907 A007895(n) = { my(s=0); while(n>0, s++; n -= fibonacci(1+A072649(n))); (s); }
%o A324907 A072649(n) = { my(m); if(n<1, 0, m=0; until(fibonacci(m)>n, m++); m-2); }; \\ From A072649
%o A324907 A324907(n) = A007895(A113175(n));
%Y A324907 Cf. A113175, A007895, A300837, A324888, A324905.
%K A324907 nonn
%O A324907 1,9
%A A324907 _Antti Karttunen_, Apr 14 2019