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 A140776 #16 Mar 06 2024 04:47:15
%S A140776 2,6,10,12,22,24,28,30,34,40,42,48,52,58,60,66,70,76,78,82,84,88,90,
%T A140776 102,112,118,120,130,132,138,142,148,160,168,172,180,184,186,190,192,
%U A140776 198,202,204,208,210,214,220,222,228,232,234,238,240,246,252,268,270,274
%N A140776 A number n is included if (p + n/p) is prime, where p is the largest prime that divides n.
%C A140776 All terms are even. - _Robert Israel_, Feb 04 2018
%H A140776 Robert Israel, <a href="/A140776/b140776.txt">Table of n, a(n) for n = 1..10000</a>
%e A140776 The largest prime dividing 48 is 3. Since 3 + 48/3 = 19 is prime, then 48 is included in this sequence.
%p A140776 filter:= proc(n) local p;
%p A140776 p:= max(numtheory:-factorset(n));
%p A140776 isprime(p+n/p)
%p A140776 end proc:
%p A140776 select(filter, 2*[$1..1000]); # _Robert Israel_, Feb 04 2018
%t A140776 fQ[n_] := Block[{p = Last@ First@ Transpose@ FactorInteger@n}, PrimeQ[p + n/p] == True]; Select[ Range[2, 279], fQ@# &] (* _Robert G. Wilson v_, May 30 2008 *)
%Y A140776 Cf. A140775, A140777.
%K A140776 nonn
%O A140776 1,1
%A A140776 _Leroy Quet_, May 29 2008
%E A140776 More terms from _Robert G. Wilson v_, May 30 2008