|
%I #17 Jul 21 2021 00:45:06
%S 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,
%T 53,55,61,64,67,71,73,77,83,85,89,91,93,97,101,107,109,115,119,121,
%U 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
%N Ludic powers: numbers k such that A302031(k) < 2; numbers k such that A260739(k) is a power of 2.
%C An analog of A000961 for factorization process based on the Ludic sieve (A255127).
%C Numbers k for which A302031(k) < 2, or equally, for which A302034(k) = 1, or equally, for which A209229(A260739(k)) = 1.
%H Antti Karttunen, <a href="/A302036/b302036.txt">Table of n, a(n) for n = 1..3600</a>
%H <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%o (PARI) for(n=1,257,if(A302031(n)<2,print1(n,","))); \\ See also code in A302031.
%Y Cf. A260739, A302031, A302034.
%Y Cf. A000079, A003309, A254100 (subsequences).
%Y Cf. also A000961, A302038, A302040.
%K nonn
%O 1,2
%A _Antti Karttunen_, Apr 02 2018
|
