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

Offset: 0

Author

Rick L. Shepherd, Jan 16 2017

Keywords

• nonn
• word
• easy

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.

Examples

			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.
		

Links

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

Crossrefs

Cf. A005589, A249572.

Programs

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)):
seq(a(n), n=0..104);  # Alois P. Heinz, Jul 30 2023