

A281191


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


0



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

Table of n, a(n) for n=0..104.


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.


CROSSREFS

Cf. A005589, A249572.
Sequence in context: A090406 A152723 A237497 * A324496 A137454 A030613
Adjacent sequences: A281188 A281189 A281190 * A281192 A281193 A281194


KEYWORD

nonn,word,easy


AUTHOR

Rick L. Shepherd, Jan 16 2017


STATUS

approved



