|
%I #6 Dec 31 2023 17:00:59
%S 1,1,1,2,3,4,4,4,4,6,5,6,6,6,6,10,7,9,8,10,9,10,10,10,10,16,10,13,12,
%T 14,13,14,12,15,15,14,16,16,16,16,16,26,14,19,18,20,19,20,18,19,19,21,
%U 21,21,21,21,20,26,22,26,21,26,26,24,26,26,24,34,20,28,22,29,26,31,28,29
%N a(n) = a(a(Min(n-1,Abs(n-a(n-1)))))+a(Abs(n-a(n-3))).
%C A triple recursion of the skip one Hofstadter Q.
%t Hofstadter3[n_Integer?Positive] := Hofstadter3[n] = Hofstadter3[Hofstadter3[Min[n-1, Abs[n - Hofstadter3[n-1]]]]] + Hofstadter3[Abs[n - Hofstadter3[n-3]]]
%t Hofstadter3[0]=Hofstadter3[1] = Hofstadter3[2]= Hofstadter3[3]= 1
%t digits=200
%t ta=Table[Hofstadter3[n], {n, 1, digits}]
%Y Cf. A005185.
%K nonn
%O 0,4
%A _Roger L. Bagula_, Oct 06 2003
|
