|
| |
|
|
A094948
|
|
Number of letters in n^2.
|
|
0
|
|
|
|
4, 3, 4, 4, 7, 10, 9, 9, 9, 9, 10, 19, 19, 19, 19, 20, 18, 20, 22, 20, 11, 19, 21, 21, 21, 20, 20, 22, 22, 20, 11, 19, 21, 21, 29, 31, 30, 32, 31, 31, 21, 30, 32, 32, 31, 21, 28, 25, 27, 25, 22, 24, 27, 27, 29, 23, 32, 32, 34, 33, 23, 34, 34, 33, 21, 32, 32, 33, 32, 32, 23, 20, 32
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
Table of n, a(n) for n=0..72.
|
|
|
FORMULA
|
a(n) = A005589(A000290(n)). - Michel Marcus, Jun 21 2013
|
|
|
EXAMPLE
|
a(14)=19 because 14^2=196, which can be written out as 'one-hundred-ninety-six' which has 19 letters.
|
|
|
CROSSREFS
|
Cf. A000290, A005589.
Sequence in context: A332810 A088752 A239594 * A332472 A049788 A002558
Adjacent sequences: A094945 A094946 A094947 * A094949 A094950 A094951
|
|
|
KEYWORD
|
easy,nonn,word
|
|
|
AUTHOR
|
Gregory S. Thoman (fealuinix(AT)yahoo.com), May 26 2004
|
|
|
EXTENSIONS
|
More terms from Kristen Loughman (kloughma(AT)ashland.edu), Jan 26 2006
a(0)=4 inserted and a(7), a(12), a(21), a(29) corrected by Georg Fischer, Dec 18 2020
|
|
|
STATUS
|
approved
|
| |
|
|
