Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058008
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058008 Numbers n such that GCD[2n,C(2n,n)]=2n. +0
4
1, 6, 15, 28, 42, 45, 66, 77, 91, 110, 126, 140, 153, 156, 170, 187, 190, 204, 209, 210, 220, 228, 231, 238, 266, 276, 299, 308, 312, 315, 322, 325, 330, 345, 378, 414, 420, 429, 435, 440, 442, 450, 459, 460, 468, 476, 483, 493, 496 (list; graph; listen)
OFFSET

1,2

COMMENT

Observe also that GCD[2n,C(2n,n)]=2 holds for n=prime powers (i.e.A000961).

Also, positions where A075055 differs from A000984. - Ralf Stephan, Dec 11 2004

FORMULA

Appears to be A067348(n)/2. - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 21 2003

CROSSREFS

A001405, A000961.

Sequence in context: A161777 A117519 A091012 this_sequence A094142 A081873 A096892

Adjacent sequences: A058005 A058006 A058007 this_sequence A058009 A058010 A058011

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 13 2000

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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research