Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Array read by rows in which n-th row contains n successive primes with least sum divisible by n.
3

%I #5 Oct 11 2019 13:54:43

%S 2,3,5,3,5,7,5,7,11,13,71,73,79,83,89,5,7,11,13,17,19,7,11,13,17,19,

%T 23,29,17,19,23,29,31,37,41,43,239,241,251,257,263,269,271,277,281,13,

%U 17,19,23,29,31,37,41,43,47,29,31,37,41,43,47,53,59,61,67,71,5,7,11,13,17

%N Array read by rows in which n-th row contains n successive primes with least sum divisible by n.

%e Triangle begins:

%e 2

%e 3 5

%e 3 5 7

%e 5 7 11 13

%e 71 73 79 83 89

%e 5 7 11 13 17 19

%e 7 11 13 17 19 23 29

%e 17 19 23 29 31 37 41 43

%e 239 241 251 257 263 269 271 277 281

%e 13 17 19 23 29 31 37 41 43 47

%e 29 31 37 41 43 47 53 59 61 67 71

%e 5 7 11 13 17 19 23 29 31 37 41 43

%t f[n_] := Block[{k = 1, t},While[t = Table[Prime[i], {i, k, k + n - 1}]; Mod[Plus @@ t, n] > 0, k++ ];t];Flatten[Table[f[n], {n, 12}]]

%Y Cf. A054892 (first term of each row), A077388 (row sum), A077389 (row average).

%Y Cf. A082592, A082596, A082638, A082653, A082661.

%K nonn,tabl

%O 1,1

%A _Ray Chandler_, Sep 27 2006