This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A087839 a[n] =a[a[a[a[a[n-2]]]]]+ a[n - a[n-2]]. 1
 1, 1, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A fifth order recursion based on Colin Mallows's sequence A005229. Differs from A106742 at n = 233 where this is 23 whereas A106742(233) = 22. - Joshua Zucker, May 17 2007 LINKS MATHEMATICA Mallows[n_Integer?Positive] := Mallows[n] = Mallows[Mallows[Mallows[Mallows[Mallows[n-2]]]]]+ Mallows[n - Mallows[n-2]] Mallows[1] = Mallows[2] = 1 digits=200 a=Table[Mallows[n], {n, 1, digits}] CROSSREFS Cf. A004001, A005229, A106742. Sequence in context: A130241 A130247 A209869 * A106742 A106733 A087838 Adjacent sequences:  A087836 A087837 A087838 * A087840 A087841 A087842 KEYWORD nonn AUTHOR Roger L. Bagula, Oct 07 2003 EXTENSIONS Edited by N. J. A. Sloane, Jun 15 2007 STATUS approved

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

Last modified December 10 12:43 EST 2019. Contains 329896 sequences. (Running on oeis4.)