login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A329768
Number of finite sequences of positive integers whose sum minus runs-resistance is n.
1
8, 17, 42, 104, 242, 541, 1212, 2664, 5731, 12314
OFFSET
1,1
COMMENTS
A composition of n is a finite sequence of positive integers with sum n.
For the operation of taking the sequence of run-lengths of a finite sequence, runs-resistance is defined as the number of applications required to reach a singleton.
LINKS
Claude Lenormand, Deux transformations sur les mots, Preprint, 5 pages, Nov 17 2003.
EXAMPLE
The a(1) = 8 and a(2) = 17 compositions whose sum minus runs-resistance is n:
(1) (2)
(1,1) (1,3)
(1,2) (3,1)
(2,1) (1,1,1)
(1,1,2) (1,1,3)
(2,1,1) (1,2,1)
(1,1,2,1) (1,2,2)
(1,2,1,1) (2,2,1)
(3,1,1)
(1,1,1,2)
(1,1,3,1)
(1,3,1,1)
(2,1,1,1)
(1,1,1,2,1)
(1,2,1,1,1)
(1,2,1,1,2)
(2,1,1,2,1)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Nov 21 2019
STATUS
approved