|
%I #12 Oct 31 2019 11:53:29
%S 1,1,2,3,4,4,5,6,5,6,7,8,6,7,8,9,7,8,9,10,11,8,9,10,11,12,13,9,10,11,
%T 12,13,10,11,12,13,14,15,11,12,13,14,15,16,17,12,13,14,15,16,17,18,19,
%U 13,14,15,16,17,18,14,15,16,17,18,19,20,15,16,17,18,19,20,21,22,16,17,18
%N a(0)=1. For n>=1, n-th run consists of the integers (in ascending order) of n through a(n-1)+n-1.
%e The sequence grouped by (ascending) runs, where the n-th run, for n>=1, consists of a(n-1) integers: 1, (1), (2), (3, 4), (4, 5, 6), (5, 6, 7, 8), (6, 7, 8, 9), (7, 8, 9, 10, 11), (8, 9, 10, 11, 12, 13), (9, 10, 11, 12, 13), ...
%t f[l_List] := Block[{n = Length[l]},Append[l, Range[n, Flatten[l][[n]] + n - 1]]];Flatten@Nest[f, {{1}}, 16] (* _Ray Chandler_, Jan 05 2007 *)
%K easy,nonn
%O 0,3
%A _Leroy Quet_, Jan 01 2007
%E Extended by _Ray Chandler_, Jan 05 2007
|
