|
Search: id:A107488
|
|
|
| A107488 |
|
Number of letters in the words formed by the digital recitation of Pi in the English language. |
|
+0
3
|
|
| 5, 3, 4, 3, 4, 4, 3, 3, 4, 5, 4, 5, 4, 5, 4, 5, 3, 5, 5, 4, 3, 3, 3, 4, 5, 5, 5, 5, 3, 5, 4, 4, 4, 3, 5, 5, 4, 3, 4, 5, 3, 3, 4, 5, 4, 4, 5, 5, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 4, 4, 4, 4, 4, 3, 5, 4, 5, 5, 3, 3, 4, 4, 3, 3, 5, 3, 3, 4, 5, 4, 4, 5, 3, 3, 5, 4, 5, 4, 5, 3, 4, 5, 4, 3, 3, 3, 5, 4, 3, 5, 4, 5, 3, 3, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Essentially the same as A052384. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 24 2008]
|
|
EXAMPLE
|
Three, one, four, one, five, nine has digit count 5, 3, 4, 3, 4, 4 the first 6 entries in the sequence.
|
|
PROGRAM
|
(PARI) readpi(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(Pi)); print1(5", "); for(x=3, n-1, y=floor(eval(a[x])); print1(d[y+1]", ") ) }
|
|
CROSSREFS
|
Sequence in context: A011426 A090343 A135448 this_sequence A114236 A137898 A020854
Adjacent sequences: A107485 A107486 A107487 this_sequence A107489 A107490 A107491
|
|
KEYWORD
|
base,easy,nonn,word
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), May 28 2005
|
|
|
Search completed in 0.002 seconds
|
