Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014491
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014491 GCD(n, 2^n - 1). +0
3
1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 9, 1, 5, 7, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 9, 1, 1, 1, 5, 1, 21, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 27, 1, 1, 1, 1, 1, 15, 1, 1, 7, 1, 1, 3, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 3, 1, 5, 1, 1, 1, 21, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 3, 1, 1 (list; graph; listen)
OFFSET

1,6

CROSSREFS

Adjacent sequences: A014488 A014489 A014490 this_sequence A014492 A014493 A014494

Sequence in context: A137578 A109390 A130046 this_sequence A061680 A097558 A124385

KEYWORD

nonn,easy,nice

AUTHOR

Gary M. Mcguire (gmm8n(AT)weyl.math.virginia.edu)

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 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research