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 A255441 #28 Apr 24 2024 02:44:57
%S A255441 252601,3828001,82929001,366652201,8251854001,12173703001,25749237001,
%T A255441 67495942201,82380774001,285983187601,802204143001,1039708768201,
%U A255441 1068674250001,1158788350201,2997587784001,3236207713201,4467180843001,7902515425201,8470346587201
%N A255441 Carmichael numbers of the form (60k+41)*(90k+61)*(150k+101), where 60k+41, 90k+61 and 150k+101 are all primes.
%H A255441 Amiram Eldar, <a href="/A255441/b255441.txt">Table of n, a(n) for n = 1..10000</a>
%H A255441 Umberto Cerruti, <a href="/A255441/a255441.pdf">Pseudoprimi di Fermat e numeri di Carmichael</a> (in Italian), p. 10.
%H A255441 <a href="/index/Ca#Carmichael">Index entries for sequences related to Carmichael numbers</a>.
%t A255441 f[k_] := {60*k + 41, 90*k + 61, 150*k + 101}; Times @@ f[#]& /@ Select[Range[0, 500], And @@ PrimeQ[f[#]] &] (* _Amiram Eldar_, Apr 24 2024 *)
%o A255441 (Magma) [(60*n+41)*(90*n+61)*(150*n+101): n in [0..300]| IsPrime(60*n+41) and IsPrime(90*n+61) and IsPrime(150*n+101)];
%o A255441 (PARI) lista(kmax) = for(k = 0, kmax, if(isprime(60*k + 41) && isprime(90*k + 61) && isprime(150*k + 101), print1((60*k+41)*(90*k+61)*(150*k+101), ", "))); \\ _Amiram Eldar_, Apr 24 2024
%Y A255441 Cf. A002997, A033502.
%Y A255441 Cf. A255512 (associated k).
%K A255441 nonn
%O A255441 1,1
%A A255441 _Vincenzo Librandi_, Feb 24 2015
%E A255441 First term added from _Bruno Berselli_, Feb 24 2015