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 A365023 #7 Aug 24 2023 03:12:21
%S A365023 2821,63973,530881,658801,670033,852841,1050985,2113921,4909177,
%T A365023 6049681,6054985,8355841,8719921,9494101,9585541,9613297,11205601,
%U A365023 11972017,12262321,15888313,17316001,26932081,35703361,36765901,38637361,41471521,43331401,43620409,45890209
%N A365023 The greater of twin Carmichael numbers: a pair of consecutive Carmichael numbers (A002997) without a non-prime-power weak Carmichael number (A087442) between them.
%H A365023 Amiram Eldar, <a href="/A365023/b365023.txt">Table of n, a(n) for n = 1..1000</a>
%H A365023 Mauro Fiorentini, <a href="http://www.bitman.name/math/article/919">Carmichael gemelli (numeri di)</a> (in Italian).
%H A365023 Romeo Meštrović, <a href="http://arxiv.org/abs/1305.1867">Generalizations of Carmichael numbers I,</a> arXiv:1305.1867 [math.NT], 2013.
%t A365023 npwcQ[n_] := Length[(p = FactorInteger[n][[;; , 1]])] > 1 && AllTrue[p, Divisible[n - 1, # - 1] &]; (* A087442 *)
%t A365023 seq[nmax_] := Module[{carmichaels = Select[Range[1, nmax, 2], CompositeQ[#] && Divisible[# - 1, CarmichaelLambda[#]] &], s = {}, c1, c2}, Do[c1 = carmichaels[[k]] + 2; c2 = carmichaels[[k + 1]] - 2; While[c1 < c2, If[npwcQ[c1], Break[]]; c1 += 2]; If[c1 == c2, AppendTo[s, carmichaels[[k+1]]]], {k, 1, Length[carmichaels] - 1}]; s]; seq[10^6]
%Y A365023 Subsequence of A002997.
%Y A365023 Cf. A000961, A087442, A225498, A365022 (lesser counterparts), A365024.
%K A365023 nonn
%O A365023 1,1
%A A365023 _Amiram Eldar_, Aug 17 2023