|
|
A061432
|
|
a(n) = smallest n-digit square.
|
|
7
|
|
|
1, 16, 100, 1024, 10000, 100489, 1000000, 10004569, 100000000, 1000014129, 10000000000, 100000147984, 1000000000000, 10000002149284, 100000000000000, 1000000025191729, 10000000000000000, 100000000621806289, 1000000000000000000, 10000000005259630921
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
a(n) = ceiling(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;
|
|
MATHEMATICA
|
Table[Ceiling[Sqrt[10^n]]^2, {n, 0, 20}] (* Harvey P. Dale, Dec 29 2015 *)
|
|
PROG
|
(PARI) {a(n) = ceil(sqrt(10^n))^2}; \\ G. C. Greubel, Mar 08 2019
(Magma) [Ceiling(Sqrt(10^n))^2: n in [0..20]]; // G. C. Greubel, Mar 08 2019
(Sage) [ceil(sqrt(10^n))^2 for n in (0..20)] # G. C. Greubel, Mar 08 2019
(Python)
from math import isqrt
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), May 16 2001
|
|
STATUS
|
approved
|
|
|
|