login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087827 a(n) = a(a(Min(n-1,Abs(n-a(n-1)))+a(Abs(n-a(n-3)) 0
1, 1, 1, 2, 3, 4, 4, 4, 4, 6, 5, 6, 6, 6, 6, 10, 7, 9, 8, 10, 9, 10, 10, 10, 10, 16, 10, 13, 12, 14, 13, 14, 12, 15, 15, 14, 16, 16, 16, 16, 16, 26, 14, 19, 18, 20, 19, 20, 18, 19, 19, 21, 21, 21, 21, 21, 20, 26, 22, 26, 21, 26, 26, 24, 26, 26, 24, 34, 20, 28, 22, 29, 26, 31, 28, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

A triple recursion of the skip one Hofstadter Q.

LINKS

Table of n, a(n) for n=0..75.

MATHEMATICA

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

CROSSREFS

Cf. A005185.

Sequence in context: A029106 A064004 A195849 * A136528 A225486 A130242

Adjacent sequences:  A087824 A087825 A087826 * A087828 A087829 A087830

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Oct 06 2003

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 24 16:03 EST 2014. Contains 249899 sequences.