Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087838
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087838 a[n] =a[a[a[a[n-2]]]]+ a[n - a[n-2]] +0
1
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; listen)
OFFSET

1,3

COMMENT

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

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 this_sequence A057627 A013940 A029129

Adjacent sequences: A087835 A087836 A087837 this_sequence A087839 A087840 A087841

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 07 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research