OFFSET
1,1
COMMENTS
This is an implementation of the suggestion that Walter A. Kehowski made on his website (see link) with regard to so-called indecomposable sigma-powerful numbers. However, the results deviate from the table linked there. The table is considered to be deficient.
LINKS
David A. Corneth, Table of n, a(n) for n = 1..6421 (terms < 10^18)
Walter A. Kehowski, Sigma-powerful numbers, Aug 09 2010.
EXAMPLE
From David A. Corneth, Aug 29 2020: (Start)
No two proper divisors of 400 are sigma-powerful and have the product of those divisors 400 so 400 is in the sequence.
27783 = 81 * 343 is sigma-powerful but 81 and 343 are sigma-powerful as well so 27783 can be decomposed into two sigma-powerful factors. So 27783 is not in the sequence. (End)
PROG
(PARI) v=vector(50); n=0;
for(m=2, 150000000, my(is); if(ispowerful(m) && ispowerful(sigma(m)), v[n++]=m; is=1; for(j=1, n-1, if(v[n]%v[j], , if(vecsearch(v[1..n-1], v[n]/v[j]), is=0; break))); if(is, print1(v[n], ", "))))
CROSSREFS
KEYWORD
nonn
AUTHOR
Hugo Pfoertner, Aug 15 2020
STATUS
approved
