Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050066
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050066 a(n)=a(n-1)+a(m), where m=n-1-2^p, and 2^p<n-1<=2^(p+1), for n >= 4. +0
1
1, 3, 3, 4, 7, 8, 11, 14, 18, 19, 22, 25, 29, 36, 44, 55, 69, 70, 73, 76, 80, 87, 95, 106, 120, 138, 157, 179, 204, 233, 269, 313, 368, 369, 372, 375, 379, 386, 394, 405, 419, 437, 456, 478, 503, 532, 568, 612 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Adjacent sequences: A050063 A050064 A050065 this_sequence A050067 A050068 A050069

Sequence in context: A051263 A058674 A091973 this_sequence A050064 A137894 A087329

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research