login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #17 Sep 06 2017 11:23:13

%S 1105,13981,68101,137149,149281,158369,266305,285541,423793,617093,

%T 625921,852841,1052503,1052929,1104349,1128121,1306801,1746289,

%U 2940337,3048841,3828001,4072729,4154161,4209661,4682833,6183601,6236473,6617929,7803769,9106141,11157721,11644921,12096613,12932989,13554781

%N Composite integers n satisfying 2^d == 2^(n/d) (mod n) for all d|n and that are not Super-Poulet (A050217).

%C The set difference of A291601 and A050217.

%C Terms that are Carmichael numbers (A002997) are given by A291612. - _Altug Alkan_, Aug 27 2017

%Y Cf. A001567, A050217, A291601.

%K nonn

%O 1,1

%A _Max Alekseyev_, Aug 27 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)