cp's OEIS Frontend

A387104 Split A386482 into maximal runs of consecutive decreasing terms; a(n) is the length of the n-th run.

%I A387104 #6 Aug 17 2025 09:55:01
%S A387104 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,
%T A387104 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,
%U A387104 2,2,6,104,15,2,1,1,2,3,3,1,1,4,11,5,159,9,1
%N A387104 Split A386482 into maximal runs of consecutive decreasing terms; a(n) is the length of the n-th run.
%H A387104 Rémy Sigrist, <a href="/A387104/b387104.txt">Table of n, a(n) for n = 1..10000</a>
%H A387104 Rémy Sigrist, <a href="/A387104/a387104.gp.txt">PARI program</a>
%F A387104 A387103(1 + Sum_{k = 1..n} a(k)) = 0 for any n > 0.
%e A387104 The first terms, alongside the corresponding runs, are:
%e A387104   n   a(n)  Corresponding run
%e A387104   --  ----  --------------------------------------
%e A387104    1     1  1
%e A387104    2     1  2
%e A387104    3     1  4
%e A387104    4     2  6, 3
%e A387104    5     1  9
%e A387104    6     3  12, 10, 8
%e A387104    7     2  14, 7
%e A387104    8     3  21, 18, 16
%e A387104    9     3  20, 15, 5
%e A387104   10     1  25
%e A387104   11     6  30, 28, 26, 24, 22, 11
%e A387104   12     2  33, 27
%e A387104   13     3  36, 34, 32
%e A387104   14     2  38, 19
%e A387104   15    10  57, 54, 52, 50, 48, 46, 44, 42, 40, 35
%e A387104   16     3  45, 39, 13
%o A387104 (PARI) \\ See Links section.
%Y A387104 Cf. A386482, A387103.
%K A387104 nonn
%O A387104 1,4
%A A387104 _Rémy Sigrist_, Aug 16 2025