|
%I #5 Mar 30 2012 17:34:13
%S 1,1,2,3,3,3,4,4,4,4,5,5,5,5,5,6,6,6,6,6,6,7,7,8,8,8,8,8,8,9,9,9,10,
%T 10,10,10,10,10,10,11,11,11,11,12,12,12,12,12,12,12,12,13,13,13,13,13,
%U 14,14,14,14,14,14,14,14,14,15,15,15,15,15,15,16,16,16,16,16,16,16,16,16
%N a[n] =a[a[a[a[n-2]]]]+ a[n - a[n-2]]
%C A fourth-order recursion based on Mallows's A005229.
%t Mallows[n_Integer?Positive] := Mallows[n] = Mallows[Mallows[Mallows[Mallows[n-2]]]]+ Mallows[n - Mallows[n-2]] Mallows[1] = Mallows[2] = 1 digits=200 a=Table[Mallows[n], {n, 1, digits}]
%Y Cf. A005229.
%K nonn
%O 1,3
%A _Roger L. Bagula_, Oct 07 2003
|
