Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069171
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069171 Numbers n such that GCD(n,2^n-1)=3. +0
1
6, 12, 24, 30, 48, 66, 78, 96, 102, 114, 132, 138, 150, 174, 186, 192, 204, 222, 228, 246, 258, 264, 276, 282, 318, 348, 354, 366, 372, 384, 390, 402, 426, 438, 444, 456, 474, 492, 498, 510, 516, 528, 534, 552, 564, 570, 582, 606, 618, 636, 642, 654, 678 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A096366 A061822 A119840 this_sequence A071611 A119500 A110967

Adjacent sequences: A069168 A069169 A069170 this_sequence A069172 A069173 A069174

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 09 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 November 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research