login
a(n) is the smallest prime that can be the apex of a triangle with n rows, all entries being distinct primes, and all row sums equal.
0

%I #5 Jan 11 2021 23:12:39

%S 2,19,53,131,269,503,853,1361,1999,2879,3989

%N a(n) is the smallest prime that can be the apex of a triangle with n rows, all entries being distinct primes, and all row sums equal.

%C A109724(n) is a lower bound for the sum of terms of triangle.

%H Carlos Rivera, <a href="https://www.primepuzzles.net/puzzles/puzz_1026.htm">Puzzle 1026. Another pine-like-prime puzzle</a>, Prime Puzzles and Problems Connection.

%e 19

%e For n=2: 3 5 11 , so a(2) = 19.

%Y Cf. A047837, A109724.

%K nonn,more

%O 1,1

%A _Michel Marcus_, Jan 11 2021