Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080170
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080170 Numbers n such that GCD(C(2*n,n), C(3*n,n), C(4*n,n) ..., C((n+1)*n,n) ) = 1. +0
2
29, 59, 69, 83, 89, 104, 119, 125, 131, 139, 153, 164, 167, 179, 181, 194, 197, 209, 219, 230, 233, 251, 259, 263, 272, 279, 285, 305, 307, 311, 314, 329, 335, 339, 356, 359, 363, 373, 379, 384, 389, 395, 398, 407, 417, 419, 428, 439, 441, 454, 455, 461 (list; graph; listen)
OFFSET

1,1

COMMENT

A051283(n-1) - 1 (conjectured). - Ralf Stephan, Feb 20 2004

MATHEMATICA

Select[Range[500], GCD@@Table[Binomial[k*#, # ], {k, 2, #+1}]==1&]

CROSSREFS

Sequence in context: A004942 A033904 A156639 this_sequence A078848 A055784 A083821

Adjacent sequences: A080167 A080168 A080169 this_sequence A080171 A080172 A080173

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 31 2003

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research