OFFSET
1,5
COMMENTS
Segments (generated as at A055168): 1; 1,1; 1,3; 1,4,3,1; 1,6,3,2,4,1; ...
Conjecture: every positive integer occurs.
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000
EXAMPLE
Write 1, thus having 1 once, thus having 1 3 times, thus having 1 4 times and 3 once, etc.
MATHEMATICA
s = {1}; Do[s = Flatten[{s, {#, Count[s, #]} & /@ DeleteDuplicates[s]}], {24}]; s (* Peter J. C. Moses, Mar 21 2013 *)
PROG
(Python)
from collections import Counter
from sympy import flatten
t = [1]
[t.extend(flatten(Counter(t).items())) for _ in range(10)]
print(t) # Nicholas Stefan Georgescu, Jan 16 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Apr 27 2000
STATUS
approved