This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A147954 #27 Dec 28 2023 19:29:47 %S A147954 0,1,1,2,2,3,3,3,3,3,3,5,4,3,3,3,3,5,4,3,3,3,3,5,4,3,3,3,3,5,5,5,5,5, %T A147954 5,8,5,5,5,5,5,8,5,5,5,5,5,8,5,5,5,5,5,8,5,5,5,5,5,8,5,5,5,5,5,8,6,6, %U A147954 6,6,6,9,5,5,5,5,5,8,5,5,5,5,5,8,5,5,5 %N A147954 a(0) = 0, a(1) = a(2) = 1, a(n) = a(a(n-1)) + a(n-a(n-1)) for 3 <= n <= 5, and a(n) = a(a(n-1)) + r(n) for n >= 6, where r(n) = a(a(floor(n/6))) for n == 0, 1, 2, 3, 4 (mod 6), and r(n) = a(n - a(floor(n/6))) for n == 5 (mod 6). %p A147954 a := proc(n) local v; option remember; %p A147954 if n = 0 then v := 0; end if; %p A147954 if n = 1 or n = 2 then v := 1; end if; %p A147954 if 3 <= n and n <= 5 then v := a(a(n - 1)) + a(n - a(n - 1)); end if; %p A147954 if 6 <= n and 5 <> n mod 6 then v := a(a(n - 1)) + a(a(floor(n/6))); end if; %p A147954 if 6 <= n and 5 = n mod 6 then v := a(a(n - 1)) + a(n - a(floor(n/6))); end if; v; end proc; # _Petros Hadjicostas_, Apr 21 2020 %t A147954 f[0] = 0; f[1] = 1; f[2] = 1; %t A147954 f[n_] := f[n] = %t A147954 f[f[n - 1]] + %t A147954 If[n < 6, f[n - f[n - 1]], %t A147954 If[Mod[n, 6] == 0, f[f[n/6]], %t A147954 If[Mod[n, 6] == 1, f[f[(n - 1)/6]], %t A147954 If[Mod[n, 6] == 2, f[f[(n - 2)/6]], %t A147954 If[Mod[n, 6] == 3, f[f[(n - 3)/6]], %t A147954 If[Mod[n, 6] == 4, f[f[(n - 4)/6]], f[n - f[(n - 5)/6]]]]]]]]; %t A147954 Table[f[n], {n, 0, 300}] %Y A147954 Cf. A004001, A147665, A147955. %K A147954 nonn %O A147954 0,4 %A A147954 _Roger L. Bagula_, Nov 17 2008 %E A147954 Name, data, and Mathematica program edited and corrected by _Petros Hadjicostas_, Apr 21 2020