login
Triangle read by rows: prime numbers p(n) along left edge (n, 1) and p(n - 1) along right edge (n, n), with (n, k) = core((n - 1, k - 1) + (n - 1, k)) for 1 < k < n when n > 2.
0

%I #2 Mar 31 2012 10:28:53

%S 2,3,2,5,5,3,7,10,2,5,11,17,3,7,7,13,7,5,10,14,11,17,5,3,15,6,1,13,19,

%T 22,2,2,21,7,14,17,23,41,6,1,23,7,21,31,19,29,1,47,7,6,30,7,13,2,23,

%U 31,30,3,6,13,1,37,5,15,1,29,37,61,33,1,19,14,38,42,5,1,30,31

%N Triangle read by rows: prime numbers p(n) along left edge (n, 1) and p(n - 1) along right edge (n, n), with (n, k) = core((n - 1, k - 1) + (n - 1, k)) for 1 < k < n when n > 2.

%C Large clusters of small integers occur periodically.

%Y Cf. A000040, A007913

%K easy,nonn,tabl

%O 1,1

%A _Reikku Kulon_, Sep 17 2008