|
Search: id:A127008
|
|
|
| A127008 |
|
a(0)=1. For n>=1, n-th run consists of the integers in descending order of a(n-1)+n-1 through n. |
|
+0
1
|
|
| 1, 1, 2, 4, 3, 7, 6, 5, 4, 7, 6, 5, 12, 11, 10, 9, 8, 7, 6, 12, 11, 10, 9, 8, 7, 12, 11, 10, 9, 8, 12, 11, 10, 9, 16, 15, 14, 13, 12, 11, 10, 16, 15, 14, 13, 12, 11, 16, 15, 14, 13, 12, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 24, 23
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
The sequence grouped by descending runs, where the n-th run, for n>=1, consists of a(n-1) integers: 1, (1), (2), (4, 3), (7, 6, 5, 4), (7, 6, 5), (12, 11, 10, 9, 8, 7, 6), (12, 11, 10, 9, 8, 7), (12, 11, 10, 9, 8), (12, 11, 10, 9), ...
|
|
MATHEMATICA
|
f[l_List] := Block[{n = Length[l]}, Append[l, Range[Flatten[l][[n]] + n - 1, n, -1]]]; Flatten@Nest[f, {{1}}, 15] (*Chandler*)
|
|
CROSSREFS
|
Sequence in context: A065579 A056536 A108228 this_sequence A064274 A035513 A114537
Adjacent sequences: A127005 A127006 A127007 this_sequence A127009 A127010 A127011
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Jan 02 2007
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 04 2007
|
|
|
Search completed in 0.002 seconds
|
