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 A090085 #10 Oct 15 2013 22:32:20
%S A090085 9,341,91,15,217,35,25,9,91,33,15,65,21,15,341,51,45,25,45,21,55,69,
%T A090085 33,25,39,27,65,45,35,49,49,33,85,35,51,91,45,39,95,91,105,205,77,45,
%U A090085 133,133,65,49,75,51,65,85,65,55,63,57,65,133,87,341,91,63,341,65,133,91,85
%N A090085 Smallest odd pseudoprimes to base n exceeding n (like A007535 but with smallest odd terms instead of few even ones).
%H A090085 Charles R Greathouse IV, <a href="/A090085/b090085.txt">Table of n, a(n) for n = 1..10000</a>
%H A090085 <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>
%t A090085 ds[x_, b_] := Mod[ -1+b^(x-1), x] a[n_] := Block[{m=1, s=ds[m, n]}, While[(s !=0||PrimeQ[m])||Equal[m, 1] ||!Greater[m, n]||EvenQ[m], m++ ];m]; t=Table[a[n], {n, 1, 256}]
%o A090085 (PARI) a(n)=my(k=n+if(n%2,2,1));while(Mod(n,k)^(k-1)!=1 || isprime(k), k+=2);k \\ _Charles R Greathouse IV_, Apr 12 2012
%Y A090085 Cf. A007535.
%K A090085 nonn
%O A090085 1,1
%A A090085 _Labos Elemer_, Nov 25 2003