cp's OEIS Frontend

A372596 a(1)=-1; thereafter a(n) is (the number of terms that appear with a different frequency from that of a(n-1)) minus (the number of terms that appear with the same frequency).

%I A372596 #34 May 26 2024 08:20:41
%S A372596 -1,-1,-2,1,0,-1,0,3,2,1,2,-1,4,7,6,5,4,1,12,7,4,9,10,9,8,11,10,7,10,
%T A372596 5,14,17,16,15,14,15,12,9,8,11,8,5,0,-5,32,31,30,29,28,27,26,25,24,23,
%U A372596 22,21,20,19,18,17,36,19,34,21,32,29,26,23,20,17,16,19
%N A372596 a(1)=-1; thereafter a(n) is (the number of terms that appear with a different frequency from that of a(n-1)) minus (the number of terms that appear with the same frequency).
%H A372596 Neal Gersh Tolunsky, <a href="/A372596/b372596.txt">Table of n, a(n) for n = 1..10000</a>
%H A372596 Rémy Sigrist, <a href="/A372596/a372596_1.gp.txt">PARI program</a>.
%H A372596 Neal Gersh Tolunsky, <a href="/A372596/a372596_1.png">Graph of first 200000 terms</a>.
%e A372596 Let t'(n) be the number of terms that appear with a different frequency from that of a(n-1) and t(n) be the number of remaining terms.
%e A372596 The resulting a(n) = t'(n) - t(n) are then:
%e A372596    n  t'(n)  t(n) a(n)
%e A372596   --  ----  ----  ----
%e A372596    1     *     *    -1
%e A372596    2     0     1    -1
%e A372596    3     0     2    -2
%e A372596    4     2     1     1
%e A372596    5     2     2     0
%e A372596    6     2     3    -1
%e A372596    7     3     3     0
%e A372596    8     5     2     3
%e A372596    9     5     3     2
%e A372596   10     5     4     1
%o A372596 (PARI) \\ See Links section.
%Y A372596 Cf. A372598, A350768, A363764.
%K A372596 sign
%O A372596 1,3
%A A372596 _Neal Gersh Tolunsky_, May 05 2024