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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087845 a[n] =a[Min[n-1,Abs[n - a[n-1]]]] + a[a[a[Abs[n - a[n-3]]]]] 1
1, 1, 1, 2, 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, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 11, 13, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 15, 13, 15, 13, 15, 14, 15, 15, 15, 15, 15, 15, 15, 15 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

The fourth recursive of the second term of the skip one Hofstadter Q.

MATHEMATICA

Hofstadter3[n_Integer?Positive] := Hofstadter3[n] = Hofstadter3[Min[n-1, Abs[n - Hofstadter3[n-1]]]] + Hofstadter3[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}]

CROSSREFS

Cf. A005185, A081831.

Sequence in context: A107436 A002024 A123578 * A130146 A113764 A130148

Adjacent sequences:  A087842 A087843 A087844 * A087846 A087847 A087848

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 07 2003

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

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

Last modified February 16 15:27 EST 2012. Contains 205930 sequences.