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) = A289272(1+(2*A289271(n))).
5

%I #6 Jan 02 2019 11:55:16

%S 2,6,10,14,18,30,22,26,34,42,38,70,46,66,90,50,54,78,58,126,110,102,

%T 62,130,74,114,82,154,86,210,94,98,170,138,198,182,106,150,190,234,

%U 118,330,122,238,306,174,134,230,142,186,270,266,146,222,342,286,290,246,158,630,162,258,374,166,414,390,178,322,310,462,194,442,202

%N a(n) = A289272(1+(2*A289271(n))).

%H Antti Karttunen, <a href="/A322992/b322992.txt">Table of n, a(n) for n = 1..16384</a>

%F a(n) = A289272(1+(2*A289271(n))).

%o (PARI)

%o A322992(n) = A289272(1+(2*A289271(n)));

%o A289271(n) = { my(v=0,i=0,x=1); for(d=2,oo,if(n==1, return(v)); if(1==gcd(x,d)&&1==omega(d), if(!(n%d)&&1==gcd(d,n/d), v += 2^i; n /= d; x *= d); i++)); }; \\ After _Rémy Sigrist_'s program for A289271.

%o A289272(n) = { my(m=1, pp=1); while(n>0, pp++; while(!isprimepower(pp)||(gcd(pp,m)>1), pp++); if(n%2, m *= pp); n >>=1); (m); };

%Y Permutation of A016825.

%Y Cf. A289271, A289272, A322990, A322991.

%K nonn

%O 1,1

%A _Antti Karttunen_, Jan 01 2019