Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113886
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113886 finite recursive sequence with a(n) = a(a(n-2)) + a(n-a(n-1)). +0
4
1, 1, 2, 2, 4, 3, 6, 3, 9, 3, 6, 5, 9, 7, 6, 6, 12, 9, 12, 6, 15, 12, 12, 14, 15, 12, 12, 15, 16, 13, 21, 13, 18, 13, 24, 12, 30, 12, 33, 15, 25, 18, 27, 24, 30, 21, 33, 18, 34, 18, 42, 15, 39, 12, 42, 16, 52, 15, 63 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = a(a(n-2)) + a(n-a(n-1)) a(0) = a(1) = 1

MATHEMATICA

a[n_] := a[n] = a[a[n - 2]] + a[n - a[n - 1]] a[0] = a[1] = 1; Table[a[n], {n, 0, 58}]

CROSSREFS

Adjacent sequences: A113883 A113884 A113885 this_sequence A113887 A113888 A113889

Sequence in context: A140357 A089265 A113885 this_sequence A122376 A067240 A126080

KEYWORD

easy,fini,full,nonn

AUTHOR

Josh Locker (joshlocker(AT)gmail.com), Jan 28 2006

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research