Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
0,4
A triple recursion of the skip one Hofstadter Q.
Table of n, a(n) for n=0..75.
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}]
Cf. A005185.
Sequence in context: A029106 A064004 A195849 * A136528 A263252 A276334
Adjacent sequences: A087824 A087825 A087826 * A087828 A087829 A087830
nonn
Roger L. Bagula, Oct 06 2003
approved