login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = A330749(A005940(1+n)).
2

%I #8 Sep 22 2020 02:49:21

%S 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 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 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 a(n) = A330749(A005940(1+n)).

%H Antti Karttunen, <a href="/A337375/b337375.txt">Table of n, a(n) for n = 0..16383</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

%F a(n) = A330749(A005940(1+n)).

%o (PARI)

%o A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); (t); };

%o 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 A330749(n) = gcd(n, A064989(n));

%o A337375(n) = A330749(A005940(1+n));

%Y Cf. A005940, A064989, A330749, A337376, A337377.

%K nonn

%O 0,6

%A _Antti Karttunen_, Sep 11 2020