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 A365385 #11 Sep 03 2023 18:20:46 %S A365385 0,0,0,1,0,2,1,2,0,3,2,4,1,3,2,1,0,4,3,6,2,5,4,2,1,4,3,3,2,2,1,2,0,5, %T A365385 4,8,3,7,6,3,2,6,5,4,4,3,2,4,1,5,4,5,3,4,3,3,2,3,2,4,1,3,2,2,0,6,5,10, %U A365385 4,9,8,4,3,8,7,5,6,4,3,6,2,7,6,6,5,5,4,5,4,4,3,6,2,5,4,4,1,6,5,7,4,6,5,4,3,5 %N A365385 a(n) = A331410(A163511(n)). %H A365385 Antti Karttunen, <a href="/A365385/b365385.txt">Table of n, a(n) for n = 0..65537</a> %F A365385 For all n >= 1, a(n) = a(2*n) = a(A000265(n)). %o A365385 (PARI) %o A365385 A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p)); %o A365385 A331410(n) = if(!bitand(n,n-1),0,1+A331410(n+(n/vecmax(factor(n)[, 1])))); %o A365385 A365385(n) = A331410(A163511(n)); %Y A365385 Cf. A000265, A163511, A331410. %Y A365385 Cf. A131577 (positions of 0's). %Y A365385 Cf. also A334204, A364260. %K A365385 nonn %O A365385 0,6 %A A365385 _Antti Karttunen_, Sep 03 2023