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 A211455 #21 Jul 09 2015 14:13:45
%S A211455 2,2,2,2,2,2,2,6,4,2,2,2,2,2,14,4,2,2,2,2,2,14,2,34,2,2,2,14,2,2,2,6,
%T A211455 2,8,2,2,2,2,2,34,2,2,2,14,2,2,14,2,2,2,2,14,10,2,2,10,4,2,2,14,4,2,2,
%U A211455 8,6,2,2,2,14,2,2,2,2,2,34,2,14,6,38,6,2,2
%N A211455 The number of bases b for which A181780(n) is a Fermat pseudoprime.
%C A211455 Sequences A211456 and A211457 give the smallest and largest bases b; A211458 lists all bases.
%C A211455 Every term in this sequence is even. - _Geoffrey Critzer_, Apr 08 2015
%H A211455 T. D. Noe, <a href="/A211455/b211455.txt">Table of n, a(n) for n = 1..10000</a>
%H A211455 <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>
%F A211455 a(n) = A063994(m) - 2 for odd m in A181780. a(n) = A063994(m) - 1 for even m in A181780. - _Thomas Ordowski_, Dec 13 2013
%t A211455 t = {}; n = 1; While[Length[t] < 100, n++; If[! PrimeQ[n], s = Select[Range[2, n-2], PowerMod[#, n-1, n] == 1 &]; If[s != {}, AppendTo[t, {n, Length[s], s}]]]]; Transpose[t][[2]]
%t A211455 f[n_] := If[ PrimeQ@ n, {}, Count[ Table[ PowerMod[k, n - 1, n], {k, 2, n - 2}], 1]] /. {0 -> {}}; Array[f, 237] // Flatten (* _Robert G. Wilson v_, Apr 08 2015 *)
%Y A211455 Cf. A181780, A211456, A211457, A211458.
%K A211455 nonn
%O A211455 1,1
%A A211455 _T. D. Noe_, Apr 13 2012