A281191 - OEIS

A281191

Number of holes in the (American) English name of n (as printed in lower case).

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, 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, 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

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

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.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..10000

EXAMPLE

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.

MAPLE

a:= n-> (s-> add((t-> `if`(t in {"a", "b", "d", "e", "o", "p", "q"}, 1,

`if`(t="g", 2, 0)))(s[i]), i=1..length(s)))(convert(n, english)):