Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085570
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085570 If n mod 2 = 0 then 2*Sum(floor(C(n,w)/(2*w+1)),w=0..n/2-1)+floor(C(n,n/2)/(n+1)) otherwise 2*Sum(floor(C(n,w)/(2*w+1)),w=0..(n-1)/2). +0
1
1, 2, 2, 4, 5, 8, 14, 24, 39, 74, 128, 232, 423, 776, 1426, 2660, 4931, 9268, 17346, 32840, 61903, 117832, 223410, 427156, 813812, 1561830, 2987535, 5751742, 11039759, 21312036, 41025866, 79386066, 153208323, 297072312, 574604611, 1116186954, 2163216427 (list; graph; listen)
OFFSET

0,2

MAPLE

b := binomial; f2 := n->if n mod 2 = 0 then 2*add(floor(b(n, w)/(2*w+1)), w=0..n/2-1)+floor(b(n, n/2)/(n+1)); else 2*add(floor(b(n, w)/(2*w+1)), w=0..(n-1)/2); fi;

CROSSREFS

Cf. A085568-A086673.

Sequence in context: A093335 A093333 A116085 this_sequence A059850 A051630 A050045

Adjacent sequences: A085567 A085568 A085569 this_sequence A085571 A085572 A085573

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jul 07 2003

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research