|
%I #2 Mar 30 2012 18:57:11
%S 1,1,1,1,3,1,1,5,3,1,1,7,4,3,1,1,9,5,4,3,1,1,11,7,5,4,3,1,1,13,8,7,5,
%T 4,3,1,1,15,10,9,7,5,4,3,1,1,17,11,11,9,7,5,4,3,1,1,19,13,12,11,9,7,5,
%U 4,3,1,1,21,14,13,12,11,9,7,5,4,3,1,1,23,15,15,13,13,11,9,7,5,4,3,1
%N Array whose rows result from iterating an algorithm that takes (1,1,1,1,...) to (1,3,5,7,...).
%C Row 1: A000012 (constant sequence of 1's)
%C Row 2: A005408 (odd positive integers)
%C Row 3: A136119
%C limit-row: A003159
%F To generate row n+1 from row n, let
%F (row n) = (s(1), s(2), s(3), ...)
%F (row n+1) = (t(1), t(2), t(3), ...)
%F Then for k=1,2,3,..., let
%F t(k) = least positive integer not yet in sequences t or u
%F u(k) = t(k) + s(k).
%e Northwest corner:
%e 1...1...1...1...1....1...1....1....1...
%e 1...3...5...7...9...11...13...15...17...
%e 1...3...4...5...7...8....10...11...13...
%e 1...3...4...5...7...9....11...12...13...
%Y Cf. A005408, A136119, A003159, A181108.
%K nonn,tabl
%O 1,5
%A _Clark Kimberling_, Oct 03 2010
|
