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 A060811 #10 Nov 21 2013 12:47:28 %S A060811 0,1,2,3,10,11,12,15,20,21,22,26,30,38,100,109,119,131,149,165,168, %T A060811 173,200,212,216,235,258,264,298,300,313,400,500,600,700,738,745,800, %U A060811 900,1000,1001,1002,1003,1010,1020,1022,1030,1054,1056,1059,1100,1156,1200 %N A060811 Numbers whose square has a majority of one digit. %H A060811 Charles R Greathouse IV, <a href="/A060811/b060811.txt">Table of n, a(n) for n = 1..10000</a> %e A060811 2038^2=4153444 and more than half the digits are 4's. %t A060811 Select[Range[0,1300],Max[DigitCount[#^2,10]]> (IntegerLength[#^2]/2)&] (* _Harvey P. Dale_, Apr 01 2011 *) %o A060811 (PARI) is(n)=my(v=vecsort(eval(Vec(Str(n^2)))), m=v[(#v+1)\2]); sum(i=1,#v,v[i]==m)*2>#v \\ _Charles R Greathouse IV_, Apr 07 2012 %K A060811 base,nonn %O A060811 1,3 %A A060811 _Erich Friedman_, Apr 29 2001