|
%I #7 Sep 07 2018 03:40:02
%S 63973,192739365541,461574735553,10028704049893,84154807001953,
%T 197531244744661,973694665856161,3060522900274753,3183276534603733,
%U 11861640972220321,26862493078871893,51516243805731301,190276732600534693,245840587068477781,386096840467598593
%N Extended Chernick Carmichael numbers that are the product of 4 or more distinct prime factors.
%C Numbers of the form: (6*m + 1) * (12*m + 1) * Product_{i=1..k-2} (9 * 2^i * m + 1), where k >= 4, with the condition that each of the factors is prime and that m is divisible by 2^(k-4).
%H Daniel Suteu, <a href="/A317136/b317136.txt">Table of n, a(n) for n = 1..9944</a>
%H Jack Chernick, <a href="https://doi.org/10.1090/S0002-9904-1939-06953-X">On Fermat's simple theorem</a>, Bull. Amer. Math. Soc. 45:4 (1939), pp. 269-274.
%H Daniel Suteu, <a href="/A317136/a317136.pl.txt">Perl program</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CarmichaelNumber.html">Carmichael Number</a>
%H <a href="/index/Ca#Carmichael">Index entries for sequences related to Carmichael numbers.</a>
%Y Cf. A182518. Subsequence of A317126.
%K nonn
%O 1,1
%A _Daniel Suteu_, Jul 22 2018
| 