OFFSET
1,1
COMMENTS
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
x^2 == 9 (mod 16) has solutions 3, 5, 11 and 13, so x^2 == 9 (mod 16 * k) have these solutions, and possibly more as well. Only solutions to the equation x^2 == 9 (mod n) are shown where no proper divisor of n has nontrivial solutions. So 32 isn't shown as 16 has nontrivial solutions as well and is a proper divisor of 32.
PROG
(PARI) is(n, {t=1})={if(n<16, return(0)); my(v2=valuation(n, 2), v3=valuation(n, 3), k=n/2^v2/3^v3); if(v2<3 && v3<2, if(v2>1, k>1, !isprimepower(k)), if(t==1, d=divisors(n); sum(i=1, #d-1, is(d[i], 0))==0, 1))} /* David A. Corneth, Jun 11 2016, modified PARI-program in A273543 from Charles R Greathouse IV */
CROSSREFS
KEYWORD
nonn
AUTHOR
David A. Corneth, Jun 10 2016
STATUS
approved