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 A288153 #8 Jun 05 2017 21:27:03
%S A288153 1729,1905,2047,2465,3277,4033,4681,8321,12801,15841,16705,18705,
%T A288153 25761,29341,33153,34945,41041,42799,46657,49141,52633,65281,74665,
%U A288153 75361,80581,85489,87249,88357,90751,104653,113201
%N A288153 Plumb pseudoprimes: odd composites that pass Colin Plumb's extended Euler criterion test.
%C A288153 Suppose n is composite. Then if n = 1 mod 8, it is in the sequence if 2^((n-1)/4) = 1 or -1 mod n; if n = 3 or 5 mod 8, it is in the sequence if 2^((n-1)/2) = -1 mod n; and if n = 3 mod 8, it is in the sequence if 2^((n-1)/2) = 1 mod n.
%C A288153 a(1) = 1729 is the Hardy-Ramanujan number. - _Omar E. Pol_, Jun 05 2017
%H A288153 Charles R Greathouse IV, <a href="/A288153/b288153.txt">Table of n, a(n) for n = 1..10000</a>
%o A288153 (Perl) use Math::Prime::Util ':all'
%o A288153 foroddcomposites { print "$_, " if is_euler_plumb_pseudoprime($_); } 9,999999;
%o A288153 (PARI) is(n)=if(n<2 || isprime(n) || n%2==0, return(0)); my(n8=n%8, e=n>>((n8==1)+1), t=Mod(2,n)^e); if(t==1, n8==1 || n8==7, if(t==-1, n8==1 || n8==3 || n8==5, 0))
%Y A288153 Subsequence of A001567; A001262 is a subsequence.
%K A288153 nonn
%O A288153 1,1
%A A288153 _Charles R Greathouse IV_, Jun 05 2017