Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087827
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087827 a(n) = a(a(Min(n-1,Abs(n-a(n-1)))+a(Abs(n-a(n-3)) +0
1
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; listen)
OFFSET

0,4

COMMENT

A triple recursion of the skip one Hofstadter Q.

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: A120509 A029106 A064004 this_sequence A136528 A130242 A130245

Adjacent sequences: A087824 A087825 A087826 this_sequence A087828 A087829 A087830

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research