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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095181 Triangle read by rows in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). 3
 2, 3, 4, 5, 16, 27, 7, 8, 9, 10, 11, 18, 25, 32, 39, 13, 24, 35, 46, 57, 68, 17, 64, 111, 158, 205, 252, 299, 19, 44, 69, 94, 119, 144, 169, 194, 23, 40, 57, 74, 91, 108, 125, 142, 159, 29, 81, 133, 185, 237, 289, 341, 393, 445, 497, 31, 54, 77, 100, 123, 146, 169, 192, 215 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..64. EXAMPLE 2 3 4 5 16 27 7 8 9 10 11 18 25 32 39 13 24 35 46 57 68 MATHEMATICA row[n_] := For[r = 1, True, r++, ro = Table[Prime[n] + k*r, {k, 0, n-1}]; If[AllTrue[Rest[ro], CompositeQ[#] && !Divisible[#, Prime[n]]&], Return[ro] ] ]; Table[row[n], {n, 1, 11}] // Flatten (* Jean-François Alcover, Sep 26 2017 *) PROG (PARI) {check(p, j, a)=local(b, k); b=1; k=1; while(b&&k

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.

Last modified February 23 18:28 EST 2024. Contains 370283 sequences. (Running on oeis4.)