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 A324905 #7 Apr 14 2019 17:22:45
%S A324905 1,1,1,2,1,2,1,1,2,2,1,3,1,2,2,2,1,2,1,3,2,2,1,2,3,2,3,3,1,3,1,3,2,2,
%T A324905 3,2,1,2,2,3,1,3,1,3,3,2,1,3,3,3,2,3,1,4,3,3,2,2,1,2,1,2,4,3,3,3,1,3,
%U A324905 2,4,1,4,1,2,4,3,3,3,1,4,3,2,1,3,3,2,2,3,1,2,3,3,2,2,3,3,1,3,4,3,1,3,1,3,4
%N A324905 a(n) = A007895(A003965(n)).
%H A324905 Antti Karttunen, <a href="/A324905/b324905.txt">Table of n, a(n) for n = 1..17711</a>
%H A324905 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A324905 a(n) = A007895(A003965(n)).
%o A324905 (PARI)
%o A324905 A003965(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = fibonacci(2+primepi(f[i, 1]))); factorback(f); };
%o A324905 A007895(n) = { my(s=0); while(n>0, s++; n -= fibonacci(1+A072649(n))); (s); }
%o A324905 A072649(n) = { my(m); if(n<1, 0, m=0; until(fibonacci(m)>n, m++); m-2); }; \\ From A072649
%o A324905 A324905(n) = A007895(A003965(n));
%Y A324905 Cf. A003965, A007895, A300837, A324888, A324907.
%K A324905 nonn
%O A324905 1,4
%A A324905 _Antti Karttunen_, Apr 14 2019