Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087828
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087828 a(n) = a(Min(n-1,Abs(n - a(n-1)))) + a(a(Abs(n - a(n-3)))) +0
1
1, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 6, 5, 6, 6, 6, 6, 9, 6, 9, 9, 8, 9, 9, 9, 9, 13, 9, 13, 9, 11, 12, 13, 13, 12, 13, 13, 13, 13, 19, 12, 15, 13, 15, 13, 19, 13, 16, 17, 19, 16, 17, 19, 18, 19, 19, 19, 19, 28, 16, 19, 19, 21, 19, 28, 19, 22, 28, 21, 23, 22, 25, 25, 23, 26, 25, 23, 25 (list; graph; listen)
OFFSET

0,4

COMMENT

A second triple recursion sequence of the Hofstadter Q skip one.

MATHEMATICA

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

Sequence in context: A087836 A091497 A005707 this_sequence A110867 A006670 A132914

Adjacent sequences: A087825 A087826 A087827 this_sequence A087829 A087830 A087831

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research