The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Robert Israel, Table of n, a(n) for n = 1..999 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 CROSSREFS Cf. A065736. Sequence in context: A125326 A126484 A091100 * A115328 A223767 A223774 Adjacent sequences:  A061429 A061430 A061431 * A061433 A061434 A061435 KEYWORD nonn,base,easy AUTHOR Amarnath Murthy, May 03 2001 EXTENSIONS More terms from Larry Reeves (larryr(AT)acm.org), May 16 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 7 12:56 EDT 2021. Contains 343650 sequences. (Running on oeis4.)