%I #7 Dec 05 2013 19:56:48
%S 1,3,6,8,19,12,25,48,79,60,62,109,38,139,96,9,182,265,42,155,66,112,
%T 291,134,241,432
%N Triangle read by rows, consisting of distinct positive integers such that the absolute difference of (horizontally or vertically) adjacent numbers is a (least possible) distinct prime.
%C If there are two numbers that minimize the difference, the smaller is chosen. The sequence ends when it becomes impossible to simultaneously minimize the vertical and horizontal differences.
%Y Cf. A093900, A093901, A093902.
%K nonn,tabl,fini,full,less
%O 1,2
%A _Amarnath Murthy_, Apr 23 2004
%E Edited and extended by _David Wasserman_, Mar 16 2006