|
%I #17 Aug 03 2023 01:41:34
%S 1,1,2,3,3,3,4,4,4,4,5,5,5,5,5,6,6,6,6,6,6,7,7,7,7,7,7,7,8,8,8,8,8,8,
%T 8,8,9,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,
%U 11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13
%N a(n) = a(a(a(a(a(n - a(n-1)))))) + a(n - a(n-2)) with a(1) = a(2) = 1.
%C A sixth-order recursion based on A005185.
%C Different from A087839 - see comments in that entry.
%C Different from A106733.
%H Paolo P. Lava, <a href="/A106742/b106742.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = a(a(a(a(a(n -a(n-1)))))) + a(n-a(n-2)) with a(1) = a(2) = 1.
%t a[n_]:= a[n]= If[n<3, 1, a[a[a[a[a[n - a[n-1]]]]]] + a[n - a[n-2]]];
%t Table[a[n], {n, 90}]
%o (Sage)
%o @CachedFunction
%o def a(n): return 1 if (n<3) else a(a(a(a(a(n -a(n-1)))))) + a(n-a(n-2));
%o [a(n) for n in (1..90)] # _G. C. Greubel_, Sep 11 2021
%Y Cf. A004001, A005185, A087836, A087839, A087842, A106733.
%K nonn
%O 1,3
%A _Roger L. Bagula_, May 30 2005
%E Edited by _N. J. A. Sloane_, Jun 15 2007
|
