|
Search: id:A125568
|
|
|
| A125568 |
|
a(0)=1. For n>=1, n-th run consists of the integers (in ascending order) of n through a(n-1)+n-1. |
|
+0
1
|
|
| 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, 10, 11, 12, 13, 14, 15, 11, 12, 13, 14, 15, 16, 17, 12, 13, 14, 15, 16, 17, 18, 19, 13, 14, 15, 16, 17, 18, 14, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 21, 22, 16, 17, 18
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
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), ...
|
|
MATHEMATICA
|
f[l_List] := Block[{n = Length[l]}, Append[l, Range[n, Flatten[l][[n]] + n - 1]]]; Flatten@Nest[f, {{1}}, 16] (*Chandler*)
|
|
CROSSREFS
|
Sequence in context: A058222 A064064 A101504 this_sequence A108872 A126974 A089058
Adjacent sequences: A125565 A125566 A125567 this_sequence A125569 A125570 A125571
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jan 01 2007
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 05 2007
|
|
|
Search completed in 0.002 seconds
|
