cp's OEIS Frontend

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.

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

Original entry on oeis.org

2, 6, 10, 14, 18, 30, 22, 26, 34, 42, 38, 70, 46, 66, 90, 50, 54, 78, 58, 126, 110, 102, 62, 130, 74, 114, 82, 154, 86, 210, 94, 98, 170, 138, 198, 182, 106, 150, 190, 234, 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
Offset: 1

Views

Author

Antti Karttunen, Jan 01 2019

Keywords

Crossrefs

Permutation of A016825.

Programs

  • PARI
    A322992(n) = A289272(1+(2*A289271(n)));
    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.
    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); };

Formula

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