|
%I #7 May 23 2018 16:36:12
%S 1,2,3,5,7,11,4,6,8,9,13,17,19,23,29,10,12,14,15,16,18,31,37,41,43,47,
%T 53,59,20,21,22,24,25,26,27,28,30,32,33,34,35,36,38,39,40,42,44,45,46,
%U 48,49,50,51,52,54,61,67,71,73,79,83,89,97,101,103,107,55,56,57,58,60
%N Triangle read by rows: if n is prime, row n contains the n smallest primes not already used; if n is composite, row n contains the n smallest composite numbers not already used. A permutation of the positive integers.
%H Ivan Neretin, <a href="/A084408/b084408.txt">Table of n, a(n) for n = 1..8001</a>
%e 1
%e 2 3
%e 5 7 11
%e 4 6 8 9
%e 13 17 19 23 29
%e 10 12 14 15 16 18
%e ...
%t a = {1}; Do[a = Join[a, Take[Select[Complement[Range[Prime[PrimePi@Max@a + n]], a], ! (PrimeQ[#] \[Xor] PrimeQ[n]) &], n]], {n, 2, 12}]; a (* _Ivan Neretin_, May 23 2018 *)
%Y Cf. A084409, A084410, A084411.
%K nonn,easy,tabl
%O 1,2
%A _Amarnath Murthy_, Jun 01 2003
%E Edited and extended by _David Wasserman_, Dec 27 2004
|
