|
Search: id:A061432
|
|
|
| A061432 |
|
a(n) = smallest n-digit square. |
|
+0
6
|
|
| 1, 16, 100, 1024, 10000, 100489, 1000000, 10004569, 100000000, 1000014129, 10000000000, 100000147984, 1000000000000, 10000002149284, 100000000000000, 1000000025191729, 10000000000000000, 100000000621806289
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n)=ceil(10^((n-1)/2))^2 - Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 30 2003
|
|
EXAMPLE
|
a(4) = 1024 = 32^2 has 4 digits while 31^2 = 961 has 3 digits.
|
|
MAPLE
|
A061432 := n->ceil(10^((n-1)/2))^2;
|
|
CROSSREFS
|
Sequence in context: A125326 A126484 A091100 this_sequence A115328 A000739 A010079
Adjacent sequences: A061429 A061430 A061431 this_sequence A061433 A061434 A061435
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 03 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), May 16 2001
|
|
|
Search completed in 0.002 seconds
|
