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 A337375 #8 Sep 22 2020 02:49:21 %S A337375 1,1,1,1,1,2,1,1,1,1,3,2,1,2,1,1,1,1,1,1,5,6,3,2,1,1,3,4,1,2,1,1,1,1, %T A337375 1,1,1,2,1,1,7,5,15,6,5,6,3,2,1,1,1,1,5,6,9,4,1,1,3,4,1,2,1,1,1,1,1,1, %U A337375 1,2,1,1,1,1,3,2,1,2,1,1,11,7,7,5,35,30,15,6,7,5,15,12,5,6,3,2,1,1,1,1,1,2,1,1,7,5 %N A337375 a(n) = A330749(A005940(1+n)). %H A337375 Antti Karttunen, <a href="/A337375/b337375.txt">Table of n, a(n) for n = 0..16383</a> %H A337375 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A337375 a(n) = A330749(A005940(1+n)). %o A337375 (PARI) %o A337375 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); (t); }; %o A337375 A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)}; %o A337375 A330749(n) = gcd(n, A064989(n)); %o A337375 A337375(n) = A330749(A005940(1+n)); %Y A337375 Cf. A005940, A064989, A330749, A337376, A337377. %K A337375 nonn %O A337375 0,6 %A A337375 _Antti Karttunen_, Sep 11 2020