Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A042971
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A042971 (C(2n,n)/2 -(2^(n-1) +mod(n+1,2)C( n-1, n/2-1)))/2. +0
1
0, 0, 3, 12, 55, 210, 826, 3136, 12027, 45870, 175846, 674784, 2598102, 10024196, 38771188, 150250496, 583368787, 2268706134, 8836184878, 34461323872, 134563944322, 526023515996, 2058355584748, 8061896050432 (list; graph; listen)
OFFSET

0,3

MATHEMATICA

(Table[ Binomial[ 2n, n ]/2 -(2^(n-1) +Mod[ n+1, 2 ]Binomial[ n-1, n/2-1 ]), {n, 10} ])/2

CROSSREFS

Adjacent sequences: A042968 A042969 A042970 this_sequence A042972 A042973 A042974

Sequence in context: A006026 A107264 A052673 this_sequence A024038 A007199 A001764

KEYWORD

nonn

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be)

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 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research