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.

A366279 The least number with same prime signature as A366275, where A366275(n) = A163511(A057889(n)).

Original entry on oeis.org

1, 2, 4, 2, 8, 4, 6, 2, 16, 8, 12, 6, 12, 4, 6, 2, 32, 16, 24, 12, 36, 12, 30, 6, 24, 8, 12, 6, 12, 4, 6, 2, 64, 32, 48, 24, 72, 36, 60, 12, 72, 24, 60, 30, 60, 12, 30, 6, 48, 16, 24, 12, 36, 12, 30, 6, 24, 8, 12, 6, 12, 4, 6, 2, 128, 64, 96, 48, 144, 72, 120, 24, 216, 72, 180, 60, 180, 36, 60, 12, 144, 48, 120, 60
Offset: 0

Views

Author

Antti Karttunen, Oct 06 2023

Keywords

Crossrefs

Cf. A046523, A057889, A163511, A278531, A366275, A366280 (rgs-transform).
Cf. also A286601, A366261.

Programs

  • PARI
    A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };
    A030101(n) = if(n<1,0,subst(Polrev(binary(n)),x,2));
    A057889(n) = if(!n,n,A030101(n/(2^valuation(n,2))) * (2^valuation(n, 2)));
    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));
    A366275(n) = A163511(A057889(n));
    A366279(n) = A046523(A366275(n));

Formula

a(n) = A278531(A057889(n)).