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 k satisfying 2^d == 2^(k/d) (mod k) for all d|k and that are not Super-Poulet (A050217). 2

%I #28 Apr 23 2024 11:21:15

%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 k satisfying 2^d == 2^(k/d) (mod k) for all d|k 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

%H Amiram Eldar, <a href="/A291602/b291602.txt">Table of n, a(n) for n = 1..10000</a>

%o (PARI) is(k) = {if(k == 1 || !(k%2) || isprime(k), return(0)); my(issp = 1); fordiv(k, d, if(Mod(2, d)^d != 2, issp = 0; break)); if(!issp, fordiv(k, d, if(d^2 <= k && Mod(2, k)^d != Mod(2, k)^(k/d), return(0))); 1, 0);} \\ _Amiram Eldar_, Apr 22 2024

%Y Cf. A001567, A050217, A291601.

%K nonn,changed

%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 April 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)