Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060497
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060497 Binomial coefficient C[2^n,p(n)], where p(n) is the n-th prime. +0
2
1, 4, 56, 11440, 129024480, 13136858812224, 614965786737727286400, 23665616042362569982121184000, 4818341997044953599090397918009939136000 (list; graph; listen)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,31

EXAMPLE

n = 4, a(4) = C[16,7] = C[2^4,p(4)] = 11440.

PROGRAM

(PARI) { n=0; forprime (p=1, 128, write("b060497.txt", n++, " ", binomial(2^n, p)); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 06 2009]

CROSSREFS

A014070, A006516.

Adjacent sequences: A060494 A060495 A060496 this_sequence A060498 A060499 A060500

Sequence in context: A000315 A080984 A071579 this_sequence A092273 A071540 A103907

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 11 2001

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 November 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research