A161535 Array read by antidiagonals: Row n contains the positive multiples of the first n primes.

2, 2, 4, 2, 3, 6, 2, 3, 4, 8, 2, 3, 4, 6, 10, 2, 3, 4, 5, 8, 12, 2, 3, 4, 5, 6, 9, 14, 2, 3, 4, 5, 6, 8, 10, 16, 2, 3, 4, 5, 6, 7, 9, 12, 18, 2, 3, 4, 5, 6, 7, 8, 10, 14, 20, 2, 3, 4, 5, 6, 7, 8, 9, 12, 15, 22, 2, 3, 4, 5, 6, 7, 8, 9, 10, 14, 16, 24, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 18, 26, 2, 3, 4, 5

Offset

1,1

Links

Table of n, a(n) for n=1..95.

Example

Row 2 consists of the positive multiples of the first 2 primes (2 and 3). 2,3,4,6,8,9,10,12,14,15,16,18,20,...
From R. J. Mathar, Jul 04 2009: (Start)
The table starts
 2  4  6  8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40
 2  3  4  6  8  9 10 12 14 15 16 18 20 21 22 24 26 27 28 30
 2  3  4  5  6  8  9 10 12 14 15 16 18 20 21 22 24 25 26 27
 2  3  4  5  6  7  8  9 10 12 14 15 16 18 20 21 22 24 25 26
 2  3  4  5  6  7  8  9 10 11 12 14 15 16 18 20 21 22 24 25
 2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 18 20 21 22 24
 2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 20 21 22
 2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21
 2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21
 2  3  4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 21
(End)

Maple

T := proc(n, k) option remember; local i, a; if k = 1 then 2; else for a from procname(n, k-1) +1 do for i from 1 to n do if a mod ithprime(i) =0 then RETURN(a); fi; od: od: fi; end: for d from 1 to 15 do for k from 1 to d do printf("%d, ", T(d-k+1, k)) ; od: od: # R. J. Mathar, Jul 04 2009

Crossrefs

Sequence in context: A356878 A043262 A130860 * A138785 A131817 A214430

Adjacent sequences: A161532 A161533 A161534 * A161536 A161537 A161538

Keyword

nonn,tabl

Author

Leroy Quet, Jun 13 2009

Extensions

More terms from R. J. Mathar, Jul 04 2009

Status

approved