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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291602 Composite integers n satisfying 2^d == 2^(n/d) (mod n) for all d|n and that are not Super-Poulet (A050217). 2
1105, 13981, 68101, 137149, 149281, 158369, 266305, 285541, 423793, 617093, 625921, 852841, 1052503, 1052929, 1104349, 1128121, 1306801, 1746289, 2940337, 3048841, 3828001, 4072729, 4154161, 4209661, 4682833, 6183601, 6236473, 6617929, 7803769, 9106141, 11157721, 11644921, 12096613, 12932989, 13554781 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The set difference of A291601 and A050217.

Terms that are Carmichael numbers (A002997) are given by A291612. - Altug Alkan, Aug 27 2017

LINKS

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

CROSSREFS

Cf. A001567, A050217, A291601.

Sequence in context: A214017 A083738 A265237 * A275881 A291616 A291612

Adjacent sequences:  A291599 A291600 A291601 * A291603 A291604 A291605

KEYWORD

nonn

AUTHOR

Max Alekseyev, Aug 27 2017

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 January 21 16:22 EST 2020. Contains 331114 sequences. (Running on oeis4.)