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 A359587 #12 Jan 08 2023 15:46:03 %S A359587 1,1,2,1,2,2,3,1,4,2,3,2,3,3,4,1,2,4,5,2,6,3,5,2,4,3,8,3,5,4,5,1,6,2, %T A359587 6,4,5,5,6,2,3,6,7,3,8,5,7,2,9,4,4,3,5,8,6,3,10,5,7,4,5,5,12,1,6,6,7, %U A359587 2,10,6,7,4,5,5,8,5,9,6,7,2,16,3,5,6,4,7,10,3,5,8,9,5,10,7,10,2,3,9,12,4,5,4,5,3,12 %N A359587 Fully multiplicative with a(p) = A008578(1+A329697(p)). %H A359587 Antti Karttunen, <a href="/A359587/b359587.txt">Table of n, a(n) for n = 1..16384</a> %H A359587 Antti Karttunen, <a href="/A359587/a359587.txt">Data supplement: n, a(n) computed for n = 1..65537</a> %F A359587 For n >= 1: (Start) %F A359587 a(A000265(n)) = a(2*n) = a(n). %F A359587 A001222(a(n)) = A087436(n), %F A359587 A056239(a(n)) = A329697(n), %F A359587 A318995(a(n)) = A336396(n) = A329697(A336466(n)). %F A359587 (End) %o A359587 (PARI) %o A359587 A008578(n) = if(1==n,1,prime(n-1)); %o A359587 A329697(n) = if(!bitand(n, n-1), 0, 1+A329697(n-(n/vecmax(factor(n)[, 1])))); %o A359587 A359587(n) = { my(f=factor(n)); for(i=1, #f~, f[i, 1] = A008578(1+A329697(f[i, 1]))); factorback(f); }; %Y A359587 Cf. A000265, A001222, A008578, A056239, A087436, A318995, A329697, A336396, A336466. %K A359587 nonn,mult %O A359587 1,3 %A A359587 _Antti Karttunen_, Jan 08 2023