|
|
A107488
|
|
Number of letters in the words formed by the digital recitation of Pi in the English language.
|
|
4
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Three, one, four, one, five, nine has digit count 5, 3, 4, 3, 4, 4 the first 6 entries in the sequence.
|
|
MATHEMATICA
|
RealDigits[Pi, 10, 120][[1]]/.{0->4, 1->3, 2->3, 3->5, 5->4, 6->3, 7->5, 8->5, 9->4} (* Harvey P. Dale, Nov 04 2021 *)
|
|
PROG
|
(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
|
|
|
KEYWORD
|
base,easy,nonn,word
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|