proposed
approved
proposed
approved
editing
proposed
(PARI) is(n) = my(f=factor(n)[, 1]~, idc=[]); for(k=1, #f, idc=concat(idc, [primepi(f[k])])); for(t=1, #idc, if(idc[t]==1, next); if(n%idc[t]==0, return(0))); 1 \\ Felix Fröhlich, Mar 21 2019
proposed
editing
editing
proposed
Robert Israel, <a href="/A324849/b324849.txt">Table of n, a(n) for n = 1..10000</a>
filter:= proc(n) andmap(t -> not ((n/numtheory:-pi(t))::integer), numtheory:-factorset(n) minus {2}) end proc:
select(filter, [$1..200]); # Robert Israel, Mar 20 2019
approved
editing
proposed
approved
editing
proposed
The sequence of terms together with their prime indices begins:
1: {}
2: {1}
3: {2}
4: {1,1}
5: {3}
7: {4}
8: {1,1,1}
9: {2,2}
10: {1,3}
11: {5}
13: {6}
14: {1,4}
16: {1,1,1,1}
17: {7}
19: {8}
20: {1,1,3}
21: {2,4}
22: {1,5}
23: {9}
25: {3,3}