A372598 - OEIS

A372598

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

-2, -1, -2, -1, -4, 3, 2, 1, 0, -1, 4, -1, 4, 5, 2, 3, 0, -3, 10, 9, 8, 7, 6, 5, 0, 19, 8, 3, 16, 11, 10, 7, 4, 15, 16, 7, 12, 19, 10, 9, 12, 9, 6, 11, 8, 3, 30, 37, 36, 35, 34, 33, 32, 31, 30, 19, 14, 33, 22, 35, 20, 37, 18, 39, 38, 37, 18, 23, 40, 39, 22, 19

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

Neal Gersh Tolunsky, Table of n, a(n) for n = 1..10000

Rémy Sigrist, PARI program.

Neal Gersh Tolunsky, Graph of first 200000 terms.

EXAMPLE

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.

The resulting a(n) = t'(n) - t(n) are then:

n t'(n) t(n) a(n)

-- ---- ---- ----