A317369 a(0) = 0, a(1) = 1; for n >= 2, a(n) = freq(a(n-s(n)),n) where s = A000196 and freq(i, j) is the number of times i appears in the terms a(0) .. a(j-1).

0, 1, 1, 2, 2, 2, 3, 3, 2, 2, 2, 6, 6, 6, 3, 3, 3, 3, 6, 6, 6, 6, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 13, 13, 13, 13, 13, 13, 6, 6, 6, 6, 6, 6, 6, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9

Offset: 0

Author

Altug Alkan, Jul 26 2018

Keywords

• nonn

Links

• Altug Alkan, A line graph of a(n) for n <= 50000
• Altug Alkan, A line graph of a(n) - A000196(n) + 1

Crossrefs

Cf. A000196, A028391, A317223, A317359.

Programs

Mathematica

Nest[Append[#1, Count[#1, #1[[-Floor@ Sqrt@ #2]] ]] & @@ {#, Length@ #} &, {0, 1}, 92] (* Michael De Vlieger, Jul 27 2018 *)