|
Search: id:A122530
|
|
|
| A122530 |
|
Decreasing runs. The size of each run is given by the sequence itself. First run starts with "1", second with "2", third with "3", fourth with "4", etc. |
|
+0
1
|
|
| 1, 2, 1, 3, 4, 3, 2, 5, 4, 3, 2, 6, 5, 4, 7, 6, 8, 7, 6, 5, 4, 9, 8, 7, 6, 10, 9, 8, 11, 10, 12, 11, 10, 9, 8, 7, 13, 12, 11, 10, 9, 14, 13, 12, 11, 15, 14, 13, 12, 11, 10, 9, 16, 15, 14, 13, 12, 11, 17, 16, 15, 14, 13, 12, 11, 10, 18, 17, 16, 15, 14, 13, 12, 19, 18, 17, 16, 15, 14, 20
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Terms computed by Gilles Sadowski
|
|
EXAMPLE
|
S is the sequence and R is the size of each run:
S=1,2,1,3,4,3,2,5,4,3,2,6,5,4,7,6,8,7,6,5,4,9,8,7,6,10,9,8,11,10...
S=1,(2,1),(3),(4,3,2),(5,4,3,2),(6,5,4),(7,6),(8,7,6,5,4)...
R=1 2 1 3 4 3 2 5... = sequence S
|
|
CROSSREFS
|
Adjacent sequences: A122527 A122528 A122529 this_sequence A122531 A122532 A122533
Sequence in context: A059126 A059128 A050273 this_sequence A022466 A144254 A133310
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Sep 17 2006
|
|
|
Search completed in 0.002 seconds
|
