A387104 Split A386482 into maximal runs of consecutive decreasing terms; a(n) is the length of the n-th run.
1, 1, 1, 2, 1, 3, 2, 3, 3, 1, 6, 2, 3, 2, 10, 3, 5, 3, 5, 13, 3, 1, 2, 25, 2, 1, 3, 1, 1, 6, 7, 1, 3, 12, 4, 2, 33, 1, 1, 10, 6, 1, 11, 29, 51, 23, 10, 48, 61, 24, 26, 168, 1, 2, 2, 9, 1, 3, 2, 7, 2, 2, 6, 104, 15, 2, 1, 1, 2, 3, 3, 1, 1, 4, 11, 5, 159, 9, 1
Offset: 1
Keywords
Examples
The first terms, alongside the corresponding runs, are: n a(n) Corresponding run -- ---- -------------------------------------- 1 1 1 2 1 2 3 1 4 4 2 6, 3 5 1 9 6 3 12, 10, 8 7 2 14, 7 8 3 21, 18, 16 9 3 20, 15, 5 10 1 25 11 6 30, 28, 26, 24, 22, 11 12 2 33, 27 13 3 36, 34, 32 14 2 38, 19 15 10 57, 54, 52, 50, 48, 46, 44, 42, 40, 35 16 3 45, 39, 13
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..10000
- Rémy Sigrist, PARI program
Programs
-
PARI
\\ See Links section.
Formula
A387103(1 + Sum_{k = 1..n} a(k)) = 0 for any n > 0.