|
%I #13 Feb 16 2024 01:23:50
%S 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,
%T 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,
%U 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
%N 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.
%C Same as A324078 with pairs after a(0) swapped.
%H Michael De Vlieger, <a href="/A324079/b324079.txt">Table of n, a(n) for n = 0..10000</a>
%e 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, ...
%t Nest[Append[#, Reverse@ First@ SortBy[Union@ Tally[Flatten@ #], Last]] &, {{1}}, 52] // Flatten (* _Michael De Vlieger_, Feb 25 2019 *)
%Y Cf. A324078.
%K nonn
%O 0,4
%A _Joerg Arndt_, Feb 15 2019
|
