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 A255512 #28 Apr 24 2024 02:44:42
%S A255512 0,1,4,7,21,24,31,43,46,70,99,108,109,112,154,158,176,213,218,234,238,
%T A255512 267,273,311,319,337,381,515,518,519,528,540,658,680,689,704,736,739,
%U A255512 752,781,837,889,1012,1071,1165,1170,1180,1197,1233,1331,1344,1373,1379
%N A255512 Numbers k such that 60*k+41, 90*k+61 and 150*k+101 are all prime.
%H A255512 Amiram Eldar, <a href="/A255512/b255512.txt">Table of n, a(n) for n = 1..10000</a>
%H A255512 Umberto Cerruti, <a href="/A255512/a255512.pdf">Pseudoprimi di Fermat e numeri di Carmichael</a> (in Italian), p. 10.
%H A255512 <a href="/index/Ca#Carmichael">Index entries for sequences related to Carmichael numbers</a>.
%t A255512 Select[Range[0, 1400], PrimeQ[60 # + 41] && PrimeQ[90 # + 61] && PrimeQ[150 # + 101] &]
%t A255512 Select[Range[0,1500],AllTrue[{60#+41,90#+61,150#+101},PrimeQ]&] (* _Harvey P. Dale_, Jan 13 2024 *)
%o A255512 (Magma) [n: n in [0..2000]| IsPrime(60*n+41) and IsPrime(90*n+61) and IsPrime(150*n+101)];
%o A255512 (PARI) is(k) = isprime(60*k + 41) && isprime(90*k + 61) && isprime(150*k + 101); \\ _Amiram Eldar_, Apr 24 2024
%Y A255512 Cf. A202113.
%Y A255512 Cf. A255441 (Carmichael numbers of the form (60k+41)*(90k+61)*(150k+101)).
%K A255512 nonn
%O A255512 1,3
%A A255512 _Vincenzo Librandi_, Feb 24 2015