|
%I #4 Dec 05 2013 19:56:12
%S 0,11,0,211,131,0,313,503,0,433,353,0,643,653,0,1069,881,0,1693,2459,
%T 0,3469,4289,0,6379,6983,0,9883,9857,0,19759,32999,0,49597,58679,0,
%U 79867,89669,0,167899,268979,0,467899,498689,0,699697,799859,0,998779,2499989
%N In the following triangular array the n-th row contains n primes (wherever possible) with digit sum n. Sequence contains the leading diagonal with a zero if no number exists.
%e Triangle begins:
%e -
%e 2 11
%e 3 - -
%e 13 31 103 211
%e 5 23 41 113 131
%e - - - - - -
%e 7 43 61 151 223 241 313
%e ...
%K base,nonn
%O 1,2
%A _Amarnath Murthy_, Apr 12 2003
%E Corrected and extended by _David Wasserman_, Aug 26 2004
|
