%I A114906
%S A114906 1,1,1,2,2,0,2,1,3,0,2,3,2,2,2,4,1,4,1,4,0,5,3,4,2,1,2,4,5,3,4,2,2,2,2,
%T A114906 2,6,2,6,1,5,1,1,2,6,8,4,2,3,5,4,3,1,2,3,5,5,5,4,3,2,2,4,5,4,3,5,6,5,2,
%U A114906 2,4,3,6,5,2,2,4,8,4,6,1,6,3,4,4,6,1,6,3,4,10,4,5,4,5,2,8,2,5,4,5,2,8,
               2
%N A114906 Triangle where a(1,1) = 1; a(n,m) = number of terms in row (n-1) which, 
               when added to m, are primes.
%C A114906 Rows n>=6 are identical to those in A114905. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Mar 13 2007
%H A114906 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A114906 Row 4 of the triangle is [2,1,3,0]. Adding 1 to these gives [3,2,4,1], 
               of which 2 terms are primes. Adding 2 to these gives [4,3,5,2], of 
               which 3 terms are primes. Adding 3 to these gives [5,4,6,3], of which 
               2 terms are primes. Adding 4 to these gives [6,5,7,4], of which 2 
               terms are primes. And adding 5 to these gives [7,6,8,5], of which 
               2 terms are primes. So row 5 is [2,3,2,2,2].
%p A114906 A114906 := proc(rowmax) local a,n,m,t ; a := matrix(rowmax,rowmax) ; 
               a[1,1] := 1 ; for n from 2 to rowmax do for m from 1 to n do a[n,
               m] := 0 ; for t from 1 to n-1 do if isprime( m+a[n-1,t] ) then a[n,
               m] := a[n,m]+1 ; fi ; od ; od ; od ; RETURN(a) ; end: rowmax := 15 
               : a := A114906(rowmax) : for n from 1 to rowmax do for m from 1 to 
               n do printf("%d, ",a[n,m]) ; od ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Mar 13 2007
%Y A114906 Cf. A114905, A114919, A114920.
%Y A114906 Sequence in context: A050949 A074943 A045719 this_sequence A114700 A140666 
               A130772
%Y A114906 Adjacent sequences: A114903 A114904 A114905 this_sequence A114907 A114908 
               A114909
%K A114906 nonn,tabl
%O A114906 1,4
%A A114906 Leroy Quet Jan 06 2006
%E A114906 More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 13 2007