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 A154313 #11 Sep 10 2016 14:41:00
%S A154313 1,2,7,13,16,29,32,38,53,54,56,63,66,68,69,76,88,94,126,156,175,176,
%T A154313 182,183,191,192,212,213,218,227,248,252,255,258,259,280,282,286,291,
%U A154313 293,294,295,298,306,307,321,323,324,325,326,331,334,335,338,345,348
%N A154313 Numbers n such that abs(A007605(n) - A007953(n)) < 2.
%C A154313 Also, numbers n such that abs(A090431(n)) < 2. - _Omar E. Pol_, Jan 12 2009
%H A154313 G. C. Greubel and Charles R Greathouse IV, <a href="/A154313/b154313.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Greubel)
%e A154313 If n = 16 then prime(n) = 53 and abs((5+3)-(1+6)) = 8-7 = 1, so 16 is in the sequence.
%t A154313 Select[Range[500], Abs[Apply[Plus, RealDigits[Prime[#]][[1]]] - Sum[DigitCount[#][[i]]*i, {i, 9}]] < 2 &] (* _G. C. Greubel_, Sep 10 2016 *)
%o A154313 (PARI) list(lim)=my(v=List(),n); forprime(p=2,, if(n++>lim,break); if(abs(sumdigits(n)-sumdigits(p))<2, listput(v,n))); Vec(v) \\ _Charles R Greathouse IV_, Sep 10 2016
%Y A154313 Cf. A000040, A141468, A007605, A007953, A090431.
%K A154313 nonn,base,easy
%O A154313 1,2
%A A154313 _Juri-Stepan Gerasimov_, Jan 07 2009
%E A154313 Corrected and edited by _Omar E. Pol_, Jan 12 2009