login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069171 Numbers k such that gcd(k, 2^k-1) = 3. 0
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; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..53.

MATHEMATICA

Select[Range[700], GCD[#, 2^#-1]==3&] (* Harvey P. Dale, Nov 22 2011 *)

CROSSREFS

Sequence in context: A261476 A119840 A298033 * A071611 A216453 A119500

Adjacent sequences:  A069168 A069169 A069170 * A069172 A069173 A069174

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, Apr 09 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 24 01:49 EST 2020. Contains 338603 sequences. (Running on oeis4.)