Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049960
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049960 a(n)=a(1)+a(2)+...+a(n-1)+a(m), where m=2n-3-2^(p+1) and 2^p<n-1<=2^(p+1). +0
1
1, 2, 4, 8, 19, 35, 73, 161, 376, 680, 1363, 2741, 5536, 11375, 23737, 51647, 121495, 219254, 438511, 877037, 1754128, 3508559, 7018105, 14040383, 28098967, 56295692, 112908400, 227132417, 459528811, 940138484, 1965086401 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A116723 A058374 A007881 this_sequence A018306 A139784 A072925

Adjacent sequences: A049957 A049958 A049959 this_sequence A049961 A049962 A049963

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research