Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069113
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069113 Square-free part of C(2n,n), the central binomial numbers : the smallest number such that a(n)*C(2n,n) is a square. +0
2
2, 6, 5, 70, 7, 231, 858, 1430, 12155, 46189, 176358, 676039, 104006, 44574, 1077205, 66786710, 64822395, 90751353, 353452638, 3829070245, 134564468610, 526024740930, 2287064091, 35830670759, 71661341518, 281132955186 (list; graph; listen)
OFFSET

1,1

PROGRAM

(PARI) for(n=1, 60, print1(core(binomial(2*n, n)), ", "))

CROSSREFS

Cf. A007913.

May be the same as A085057.

Adjacent sequences: A069110 A069111 A069112 this_sequence A069114 A069115 A069116

Sequence in context: A009460 A085205 A094595 this_sequence A085057 A009462 A111119

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 06 2002

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 October 5 16:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research