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!)
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; text; internal format)
OFFSET
1,4
COMMENTS
The fourth recursive of the second term of the skip one Hofstadter Q.
LINKS
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
Sequence in context: A002024 A123578 A087836 * A130146 A113764 A130148
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Oct 07 2003
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)