Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066975
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066975 gcd( binomial(2n,n), 2^n+1 ). +0
1
1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 17, 1, 5, 9, 1, 3, 5, 3, 1, 3, 5, 3, 1, 3, 1, 1, 17, 3, 41, 1, 1, 3, 5, 129, 1, 1, 5, 1, 1, 3, 5, 3, 17, 9, 5, 3, 1, 3, 1, 9, 1, 3, 5, 3, 1, 3, 5, 3, 17, 3, 1, 3, 1, 33, 5, 3, 1, 9, 115825, 3, 97, 3, 5, 99, 1, 129, 5, 3, 1, 1, 5, 3, 17, 11, 5, 3, 1, 3, 35425, 1, 1 (list; graph; listen)
OFFSET

1,5

CROSSREFS

Adjacent sequences: A066972 A066973 A066974 this_sequence A066976 A066977 A066978

Sequence in context: A060839 A088204 A100375 this_sequence A098877 A091088 A115627

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research