Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060430
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060430 Residue C(2^n,n) mod C(2^n,2). +0
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; listen)
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: A008426 A055637 A086684 this_sequence A040404 A040405 A040406

Adjacent sequences: A060427 A060428 A060429 this_sequence 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

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 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research