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 A162199 #6 Feb 26 2019 23:00:44
%S A162199 101,103,105,107,109,201,203,205,207,209,301,303,305,307,309,401,403,
%T A162199 405,407,409,501,503,505,507,509,601,603,605,607,609,701,703,705,707,
%U A162199 709,801,803,805,807,809,901,903,905,907,909,11011,11013,11015,11017
%N A162199 Odd cyclops numbers.
%p A162199 isA134808 := proc(n) local dgs,ndgs,d ; dgs := convert(n,base,10) ; ndgs := nops(dgs) ; if ndgs mod 2 = 0 then false; else for d from 1 to ndgs do if d = (ndgs+1)/2 and op(d,dgs) <> 0 then RETURN(false); elif d <> (ndgs+1)/2 and op(d,dgs) = 0 then RETURN(false); fi; od: true; fi; end: for n from 1 to 11100 by 2 do if isA134808(n) then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jul 13 2009
%Y A162199 Cf. A134808, A134809, A162198.
%K A162199 easy,nonn
%O A162199 1,1
%A A162199 _Omar E. Pol_, Jul 04 2009
%E A162199 More terms from _R. J. Mathar_, Jul 13 2009