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 A281191 #13 Jul 30 2023 12:40:06
%S A281191 2,2,1,2,1,1,0,2,3,1,1,3,2,2,3,2,2,4,5,3,1,3,2,3,2,2,1,3,4,2,0,2,1,2,
%T A281191 1,1,0,2,3,1,1,3,2,3,2,2,1,3,4,2,0,2,1,2,1,1,0,2,3,1,0,2,1,2,1,1,0,2,
%U A281191 3,1,2,4,3,4,3,3,2,4,5,3,3,5,4,5,4,4,3,5,6,4,1,3,2,3,2,2,1,3,4,2,5,7,6,7,6
%N A281191 Number of holes in the (American) English name of n (as printed in lower case).
%C A281191 For this sequence a font is used where a, b, d, e, o, p, and q each have one hole, g has two, and all other letters have no holes.
%H A281191 Alois P. Heinz, <a href="/A281191/b281191.txt">Table of n, a(n) for n = 0..10000</a>
%e A281191 The term a(101) = 7 because the name "one hundred one" contains seven total holes in these letters: o, e, d, e, d, o, and e.
%p A281191 a:= n-> (s-> add((t-> `if`(t in {"a", "b", "d", "e", "o", "p", "q"}, 1,
%p A281191 `if`(t="g", 2, 0)))(s[i]), i=1..length(s)))(convert(n, english)):
%p A281191 seq(a(n), n=0..104); # _Alois P. Heinz_, Jul 30 2023
%Y A281191 Cf. A005589, A249572.
%K A281191 nonn,word,easy
%O A281191 0,1
%A A281191 _Rick L. Shepherd_, Jan 16 2017