Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113885
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113885 Recursive sequence with a(n)=a(a(a(n-2)))+a(n-a(n-1)) and a(0)=a(1)=1. +0
1
1, 1, 2, 2, 4, 3, 6, 3, 9, 3, 5, 8, 6, 6, 15, 7, 6, 10, 15, 7, 9, 8, 17, 9, 12, 8, 21, 9, 16, 8, 23, 12, 12, 14, 15, 16, 12, 14, 18, 15, 15, 24, 18, 14, 30, 14, 21, 28, 18, 18, 19 (list; graph; listen)
OFFSET

0,3

FORMULA

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

EXAMPLE

a(5)=3 because a(a(a(5-2)))+a(5-a(5-1)) = ... = 3

MATHEMATICA

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

CROSSREFS

Sequence in context: A138664 A140357 A089265 this_sequence A113886 A122376 A067240

Adjacent sequences: A113882 A113883 A113884 this_sequence A113886 A113887 A113888

KEYWORD

easy,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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research