login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324705 Lexicographically earliest sequence containing 1 and all composite numbers divisible by prime(m) for some m already in the sequence. 12

%I #6 Mar 11 2019 20:49:06

%S 1,4,6,8,10,12,14,16,18,20,21,22,24,26,28,30,32,34,35,36,38,39,40,42,

%T 44,46,48,49,50,52,54,56,57,58,60,62,63,64,65,66,68,70,72,74,76,77,78,

%U 80,82,84,86,87,88,90,91,92,94,95,96,98,100,102,104,105,106

%N Lexicographically earliest sequence containing 1 and all composite numbers divisible by prime(m) for some m already in the sequence.

%C A self-describing sequence, similar to A304360.

%C A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

%e The sequence of terms together with their prime indices begins:

%e 1: {}

%e 4: {1,1}

%e 6: {1,2}

%e 8: {1,1,1}

%e 10: {1,3}

%e 12: {1,1,2}

%e 14: {1,4}

%e 16: {1,1,1,1}

%e 18: {1,2,2}

%e 20: {1,1,3}

%e 21: {2,4}

%e 22: {1,5}

%e 24: {1,1,1,2}

%e 26: {1,6}

%e 28: {1,1,4}

%e 30: {1,2,3}

%e 32: {1,1,1,1,1}

%e 34: {1,7}

%e 35: {3,4}

%e 36: {1,1,2,2}

%t aQ[n_]:=Switch[n,1,True,_?PrimeQ,False,_,!And@@Cases[FactorInteger[n],{p_,k_}:>!aQ[PrimePi[p]]]];

%t Select[Range[200],aQ]

%Y Complement of A324697.

%Y Cf. A000002, A000720, A001222, A001462, A007097, A055396, A061395, A079000, A079254, A109298, A112798, A276625, A277098, A304360.

%Y Cf. A324694, A324695, A324696, A324698, A324699, A324700, A324701, A324702, A324703, A324704.

%K nonn

%O 1,2

%A _Gus Wiseman_, Mar 11 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)