Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048618
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048618 If n=2x, then Mod(C(2x, x), 2x) = 0, i.e. even n divides A001405(n), the central binomial coefficients. +0
1
2, 4, 12, 30, 40, 56, 84, 90, 132, 154, 176, 182, 208, 220, 252, 280, 306, 312, 340, 374, 380, 408, 418, 420, 440, 456, 462, 476, 480, 532, 552, 598, 616, 624, 630, 644, 650, 660, 690, 736, 756, 828, 840, 858, 870, 880, 884, 900, 918, 920, 928, 936, 952, 966 (list; graph; listen)
OFFSET

1,1

COMMENT

While for odd n the central binomial coefficients are divisible by n, this does not necessarily hold for even n.

EXAMPLE

n=30, C(30,15)=155117520=30*5170584; x=15,2x is the 4th term in the sequence

CROSSREFS

A001405, A020475.

Sequence in context: A096581 A080876 A130135 this_sequence A083554 A059412 A079472

Adjacent sequences: A048615 A048616 A048617 this_sequence A048619 A048620 A048621

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu)

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research