A107489 Number of letters in the words formed by the digital recitation of e in the English language.

3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 4, 4, 4, 4, 4, 4, 3, 5, 4, 5, 3, 4, 3, 5, 5, 4, 5, 3, 5, 4, 3, 3, 3, 3, 4, 4, 5, 5, 4, 5, 3, 4, 5, 4, 4, 5, 3, 4, 4, 4, 4, 4, 4, 5, 4, 4, 3, 3, 4, 3, 5, 3, 3, 5, 5, 3, 4, 4, 5, 3, 3, 5, 4, 5, 4, 5, 4, 4, 5, 4, 4, 4, 4, 5, 3, 5, 5, 3, 3, 5, 5, 4, 3, 4, 3, 3, 3, 4, 3, 5, 4, 3, 5, 4, 3

Offset

1,1

Links

Table of n, a(n) for n=1..105.

Prog

(PARI) reade(n) = { local(x, a, d); default(realprecision, 200); d=vector(10); a=vector(n); d[1]=4; d[2]=3; d[3]=3; d[4]=5; d[5]=4; d[6]=4; d[7]=3; d[8]=5; d[9]=5; d[10]=4; a=Vec(Str(exp(1))); print1(3", "); for(x=3, n-1, y=floor(eval(a[x])); print1(d[y+1]", ") ) }

Crossrefs

Sequence in context: A259684 A214287 A010703 * A152050 A103506 A094929

Adjacent sequences: A107486 A107487 A107488 * A107490 A107491 A107492

Keyword

base,easy,nonn,word

Author

Cino Hilliard, May 28 2005 and May 31 2005

Status

approved