Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049968
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049968 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, 3, 2, 7, 15, 29, 59, 131, 306, 554, 1109, 2231, 4506, 9259, 19321, 42039, 98893, 178466, 356933, 713879, 1427802, 2855851, 5712505, 11428407, 22871629, 45822830, 91903700, 184878269, 374041241, 765241606, 1599515283 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A053440 A114647 A052546 this_sequence A049970 A104528 A111928

Adjacent sequences: A049965 A049966 A049967 this_sequence A049969 A049970 A049971

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 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research