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 A008520 #27 Aug 12 2023 00:35:22 %S A008520 0,1,3,5,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27, %T A008520 28,29,31,33,35,37,38,39,41,43,45,47,48,49,51,53,55,57,58,59,61,63,65, %U A008520 67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90 %N A008520 Numbers whose American English name contains the letter 'e'. %C A008520 A085513(a(n)) > 0. - _Reinhard Zumkeller_, Jan 23 2015 %H A008520 Reinhard Zumkeller, <a href="/A008520/b008520.txt">Table of n, a(n) for n = 1..10000</a> %H A008520 Roel and Bas van Dijk, <a href="http://hackage.haskell.org/package/numerals">Numerals package</a>, Hackage (Haskell packages) %H A008520 <a href="/index/Lc#letters">Index entries for sequences related to number of letters in n</a> %t A008520 A008520Q[n_]:=StringContainsQ[IntegerName[n,"Words"],"e"];Select[Range[0,200],A008520Q] (* _Paolo Xausa_, Aug 11 2023 *) %o A008520 (Haskell) %o A008520 import Data.Maybe (fromJust) %o A008520 import Data.Text (Text); import qualified Data.Text as T (any) %o A008520 import Text.Numeral.Grammar.Reified (defaultInflection) %o A008520 import qualified Text.Numeral.Language.EN as EN -- see link %o A008520 a008520 n = a008520_list !! (n-1) %o A008520 a008520_list = filter (T.any (== 'e') . numeral) [0..] where %o A008520 numeral :: Integer -> Text %o A008520 numeral = fromJust . EN.gb_cardinal defaultInflection %o A008520 -- _Reinhard Zumkeller_, Jan 23 2015 %Y A008520 Cf. A006933 (complement), A085513. %Y A008520 Cf. A008519 (o), A008522 (t), A008536 (n), A008538 (s), A008540 (f), A008553 (y). %K A008520 nonn,word %O A008520 1,3 %A A008520 _N. J. A. Sloane_ %E A008520 Name edited by _Michael De Vlieger_, Aug 11 2023