

A324079


a(0) = 1, followed by pairs (multiplicity of rarest term, value of that term). Choose the least value of rarest term if there is a tie.


4



1, 1, 1, 3, 1, 1, 3, 2, 3, 1, 2, 2, 2, 3, 3, 4, 2, 1, 4, 2, 4, 3, 4, 4, 4, 6, 2, 1, 6, 2, 6, 3, 6, 4, 6, 5, 6, 1, 5, 2, 5, 3, 5, 4, 5, 5, 5, 6, 6, 7, 5, 1, 7, 2, 7, 3, 7, 4, 7, 5, 7, 6, 7, 7, 7, 9, 3, 1, 9, 2, 9, 3, 9, 4, 9, 5, 9, 6, 9, 7, 9, 8, 9, 1, 8, 2, 8, 3, 8, 4, 8, 5, 8, 6, 8, 7, 8, 8, 8, 9, 9, 10, 8, 1, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


COMMENTS

Same as A324078 with pairs after a(0) swapped.


LINKS

Michael De Vlieger, Table of n, a(n) for n = 0..10000


EXAMPLE

1, 1 time term 1, 3 times term 1, 1 time term 3, 2 times term 3, 1 time term 2, 2 times terms 2, ...


MAPLE

P:=proc(q) local a, b, c, d, k, n; a:=[1]: b:=[1]:
for n from 1 to q do c:=10^6:
for k from 1 to nops(b) do if numboccur(a, b[k])<c then
c:=numboccur(a, b[k]): d:=b[k]: fi: od: if numboccur(a, c)=0 then
b:=sort([op([op(b), c])]): fi; a:=[op(a), c, d]: od; print(op(a));
end: P(53); # Paolo P. Lava, Feb 21 2019


MATHEMATICA

Nest[Append[#, Reverse@ First@ SortBy[Union@ Tally[Flatten@ #], Last]] &, {{1}}, 52] // Flatten (* Michael De Vlieger, Feb 25 2019 *)


CROSSREFS

Cf. A324078.
Sequence in context: A225335 A229166 A143159 * A184831 A033989 A307501
Adjacent sequences: A324076 A324077 A324078 * A324080 A324081 A324082


KEYWORD

nonn


AUTHOR

Joerg Arndt, Feb 15 2019


STATUS

approved



