login
This site is supported by donations to The OEIS Foundation.

 

Logo

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!)
A087838 a[n] =a[a[a[a[n-2]]]]+ a[n - a[n-2]] 0
1, 1, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

A fourth-order recursion based on Mallows's A005229.

LINKS

Table of n, a(n) for n=1..80.

MATHEMATICA

Mallows[n_Integer?Positive] := Mallows[n] = 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. A005229.

Sequence in context: A087839 A106742 A106733 * A057627 A013940 A029129

Adjacent sequences:  A087835 A087836 A087837 * A087839 A087840 A087841

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 06:18 EST 2019. Contains 330016 sequences. (Running on oeis4.)