login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
MATHEMATICA
Nest[Append[#1, Count[#1, #1[[-Floor@ Sqrt@ #2]] ]] & @@ {#, Length@ #} &, {0, 1}, 92] (* Michael De Vlieger, Jul 27 2018 *)
CROSSREFS
Sequence in context: A107789 A124064 A348470 * A096916 A098014 A059957
KEYWORD
nonn
AUTHOR
Altug Alkan, Jul 26 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)