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 A174231 #2 Mar 30 2012 17:34:39
%S A174231 0,1,1,2,2,3,3,4,5,6,6,6,4,6,9,12,8,8,6,9,15,16,12,8,6,11,21,24,10,9,
%T A174231 8,17,14,17,23,14,11,14,33,28,14,15,14,19,17,29,18,12,7,18,25,28,34,
%U A174231 34,26,37,22,27,35,28,13,23,26,35,47,20,18,18,31,45,57,48,9,17,28,45,36,25,14
%N A174231 A chaotic designed sequence with modulo six depth if ladder.
%C A174231 Programmed during one of my OEIS banned period and never entered.
%t A174231 f[0] = 0; f[1] = 1; f[2] = 1;
%t A174231 f[n_] := f[n] = f[f[n - 1]] +
%t A174231 If[n < 6, f[n - f[(n - 1)]], If[ Mod[n, 6] == 0, f[f[n/6]],
%t A174231 If[Mod[1 + n, 6] == 1, f[f[(n - 1)/6]], If[Mod[2 + n, 6] == 2,
%t A174231 f[f[(n - 2)/6]], If[Mod[3 + n, 6] == 3, f[f[(n - 3)/6]],
%t A174231 If[Mod[4 + n, 6] == 4, f[f[(n - 4)/6]],
%t A174231 If[ Mod[5 + n, 6] == 5, f[f[(n - 5)/6]], f[n - f[(n - 2)]]]]]]]]];
%t A174231 Table[f[n], {n, 0, 100}]
%Y A174231 Cf. A147665
%K A174231 nonn,uned
%O A174231 0,4
%A A174231 _Roger L. Bagula_, Mar 13 2010