login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060430 Residue C(2^n,n) mod C(2^n,2). 2
0, 0, 0, 20, 0, 1344, 0, 8160, 0, 349184, 0, 1397760, 0, 0, 306774016, 268431360, 0, 7635468288, 0, 494779760640, 942438088704, 0, 0, 105553109975040, 0, 0, 0, 6004799480791040, 0, 192153583922184192, 0, 576460752169205760, 0, 49191317527028826112, 0 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

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

FORMULA

a(n)=Mod[A014070, A006516]=Mod[C(2^n, n), C(2^n, 2)]

MAPLE

for n from 1 to 60 do printf(`%d, `, binomial(2^n, n) mod binomial(2^n, 2)) od:

CROSSREFS

A014070, A006516.

Sequence in context: A055637 A086684 A198800 * A040404 A040405 A040406

Adjacent sequences:  A060427 A060428 A060429 * A060431 A060432 A060433

KEYWORD

easy,nonn

AUTHOR

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

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 12 2001

Corrected the OFFSET from 0,4 to 1,4 Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 05 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.