login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087834 a[n] =a[a[a[n-1]]] + a[n -1- a[n-2]] 0

%I

%S 1,1,2,2,2,3,3,3,3,4,4,4,4,4,5,5,5,5,5,5,6,7,7,7,7,7,7,7,8,9,9,9,9,9,

%T 9,9,9,9,10,11,11,11,11,11,11,11,11,11,11,11,12,13,13,13,13,13,13,13,

%U 13,13,13,13,13,13,14,15,15,15,15,15,15,15,15,15,15,15,15,15,15,15,16,17

%N a[n] =a[a[a[n-1]]] + a[n -1- a[n-2]]

%C Triple recursion version of A055748.

%t hg[n_Integer?Positive] := hg[n] =hg[hg[hg[n-1]]] + hg[n -1- hg[n-2]] hg[1] = hg[2] = 1 digits=200 a=Table[hg[n], {n, 1, digits}]

%Y Cf. A055748.

%K nonn

%O 1,3

%A _Roger L. Bagula_, Oct 07 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 24 13:11 EST 2022. Contains 350538 sequences. (Running on oeis4.)