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 A280862 #19 Oct 23 2019 10:05:35
%S A280862 1,2,4,6,10,14,15,18,21,22,26,33,34,35,38,39,45,46,50,51,54,55,57,58,
%T A280862 62,65,69,74,75,77,82,85,86,87,91,93,94,95,98,99,106,111,115,118,119,
%U A280862 122,123,129,133,134,135,141,142,143,145,146,147,153,155,158,159,161,162,166,175,177
%N A280862 Numbers n such that A258409(n) * A002322(n) = A000010(n), where A258409(1) = 1.
%C A280862 Squarefree terms > 2 give A006881.
%C A280862 Even terms are even terms of A033948.
%C A280862 No terms of the form p^k > 4, where p is a prime.
%C A280862 The sequence has natural density 0. - Information from Carl Pomerance, Jan 09 2017
%H A280862 Amiram Eldar, <a href="/A280862/b280862.txt">Table of n, a(n) for n = 1..10000</a>
%t A280862 {1}~Join~Select[Range@ 180, (GCD @@ (Divisors[#] - 1)) CarmichaelLambda@ # == EulerPhi@ # &] (* _Michael De Vlieger_, Jan 10 2017 *)
%o A280862 (PARI) a258409(n) = if(n%2==0, return(1)); if(n%3==0, return(2)); if(n%5==0 && n%4 != 1, return(2)); gcd(apply(p->p-1, factor(n)[, 1]));
%o A280862 a002322(n) = lcm(znstar(n)[2]);
%o A280862 is(n) = a258409(n) * a002322(n) == eulerphi(n);
%Y A280862 Cf. A000010, A002322, A006881, A033948, A258409.
%K A280862 nonn
%O A280862 1,2
%A A280862 _Thomas Ordowski_ and _Altug Alkan_, Jan 09 2017