Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037293
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A037293 Sum_{i=0}^{2^{n-1}} (2^{n-1} choose i)^2. +0
3
1, 2, 6, 70, 12870, 601080390, 1832624140942590534, 23951146041928082866135587776380551750, 5768658823449206338089748357862286887740211701975162032608436567264518750790 (list; graph; listen)
OFFSET

0,2

FORMULA

Central binomial coefficients for powers of 2: a(n)=A001405[A000079(n)] - Labos E. (labos(AT)ana.sote.hu), Apr 11 2001

CROSSREFS

Cf. A001405, A000079.

Sequence in context: A156458 A136268 A030242 this_sequence A129785 A000896 A103527

Adjacent sequences: A037290 A037291 A037292 this_sequence A037294 A037295 A037296

KEYWORD

nonn,easy

AUTHOR

John Tromp (tromp(AT)cwi.nl).

EXTENSIONS

More terms from Erich Friedman (erich.friedman(AT)stetson.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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research