This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A292352 #9 Sep 17 2017 22:49:53
%S A292352 24,36,40,48,60,72,80,84,96,108,120,144,168,180,192,200,216,240,252,
%T A292352 270,300,324,336,360,384,400,420,432,440,468,480,504,528,540,576,588,
%U A292352 600,624,648,660,672,714,720,744,756,768,792,810,840,864,900,912,936,960
%N A292352 Numbers that generate Lucas-Carmichael numbers using an adjusted version of Erdős's method.
%C A292352 Erdős showed in 1956 how to construct Carmichael numbers from a given number n (see A287840). With appropriate sign changes the method can be used to generate Lucas-Carmichael numbers. Given a number n, let P be the set of primes p such that (p+1)|n but p is not a factor of n. Let c be a product of a subset of P with at least 3 elements. If c == -1 (mod n) then c is a Lucas-Carmichael number.
%C A292352 Numbers with only one generated Lucas-Carmichael number: 24, 36, 40, 48, 60, 80, 84, 96, 108, 200, 252, 270, 300, 324, 336, 400, 440, 468, ...
%e A292352 The set of primes for n = 24 is P={2, 3, 5, 7, 11, 23}. One subset, {5, 7, 11, 23} have c == -1 (mod n): c = 5*7*11*23 = 8855. 24 is the least number that generates Lucas-Carmichael numbers thus a(1)=24.
%t A292352 a = {}; Do[p = Select[Divisors[n] - 1, PrimeQ]; pr = Times @@ p; pr = pr/GCD[n, pr]; ps = Divisors[pr]; c = 0; Do[p1 = FactorInteger[ps[[j]]][[;; , 1]]; If[Length[p1] < 3, Continue[]]; c1 = Times @@ p1; If[Mod[c1, n] == 1, c++], {j, 1, Length[ps]}]; If[c > 0, AppendTo[a, n]], {n, 1, 1000}]; a
%Y A292352 Cf. A006972, A287840.
%K A292352 nonn
%O A292352 1,1
%A A292352 _Amiram Eldar_, Sep 14 2017