login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087828 a(n) = a(Min(n-1,Abs(n - a(n-1)))) + a(a(Abs(n - a(n-3)))) 0

%I

%S 1,1,1,2,2,3,3,3,4,4,4,4,6,5,6,6,6,6,9,6,9,9,8,9,9,9,9,13,9,13,9,11,

%T 12,13,13,12,13,13,13,13,19,12,15,13,15,13,19,13,16,17,19,16,17,19,18,

%U 19,19,19,19,28,16,19,19,21,19,28,19,22,28,21,23,22,25,25,23,26,25,23,25

%N a(n) = a(Min(n-1,Abs(n - a(n-1)))) + a(a(Abs(n - a(n-3))))

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

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

%Y Cf. A005185.

%K nonn

%O 0,4

%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 August 7 14:43 EDT 2020. Contains 336276 sequences. (Running on oeis4.)