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!)
A087829 a[n] =a[a[Abs[n - a[n-1]]]] + a[Abs[n - a[n-4]]] 0

%I

%S 1,1,1,1,2,3,4,5,5,5,5,5,7,6,7,7,7,7,7,11,8,10,11,11,10,11,11,11,11,

%T 11,16,12,15,15,12,16,15,16,16,16,16,16,16,16,16,16,23,17,20,20,18,19,

%U 22,20,20,22,17,23,23,23,23,23,23,23,23,23,23,23,23,34,24,27,27,27,25,27

%N a[n] =a[a[Abs[n - a[n-1]]]] + a[Abs[n - a[n-4]]]

%C A triple recursion of the skip two Hofstadter Q sequence.

%t Hofstadter14[n_Integer?Positive] := Hofstadter14[n] = Hofstadter14[Hofstadter14[Abs[n - Hofstadter14[n-1]]]] + Hofstadter14[Abs[n - Hofstadter14[n-4]]] Hofstadter14[0] = Hofstadter14[1] = Hofstadter14[2]= Hofstadter14[3]= Hofstadter14[4]= 1 digits=200 ta=Table[Hofstadter14[n], {n, 1, digits}]

%Y Cf. A005185.

%K nonn

%O 0,5

%A _Roger L. Bagula_, Oct 06 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 00:05 EST 2022. Contains 350515 sequences. (Running on oeis4.)