
1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 21, 23, 25, 29, 31, 32, 37, 41, 43, 45, 47, 49, 53, 55, 61, 64, 67, 71, 73, 77, 83, 85, 89, 91, 93, 97, 101, 107, 109, 115, 119, 121, 127, 128, 131, 143, 145, 149, 151, 157, 161, 167, 173, 175, 179, 181, 189, 191, 193, 197, 205, 209, 211, 221, 223, 227, 229, 233, 235, 239, 247, 253, 256, 257
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

An analog of A000961 for factorization process based on the Ludic sieve (A255127).
Numbers n for which A302031(n) < 2, or equally, for which A302034(n) = 1, or equally, for which A209229(A260739(n)) = 1.


LINKS

Antti Karttunen, Table of n, a(n) for n = 1..3600
Index entries for sequences generated by sieves


PROG

(PARI) for(n=1, 257, if(A302031(n)<2, print1(n, ", "))); \\ See also code in A302031.


CROSSREFS

Cf. A260739, A302031, A302034.
Cf. A000079, A003309, A254100 (subsequences).
Cf. also A000961, A302038, A302040.
Sequence in context: A326536 A322902 A302040 * A331912 A326848 A328957
Adjacent sequences: A302033 A302034 A302035 * A302037 A302038 A302039


KEYWORD

nonn


AUTHOR

Antti Karttunen, Apr 02 2018


STATUS

approved

