The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036507 Smallest square containing exactly n decimal digits '0'. 11
0, 100, 102400, 10000, 10240000, 1000000, 1024000000, 100000000, 102400000000, 10000000000, 10240000000000, 1000000000000, 1024000000000000, 100000000000000, 102400000000000000, 10000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(2*n) = 10^(2*n), a(2*n+1) = 1024*10^(2*n) for k >= 1 since 1024 is the smallest square factor that contains a single '0'. - Georg Fischer, Jul 03 2023
MATHEMATICA
nsmall = Table[Infinity, 20];
For[i = 0, i <= 4*10^6, i++, n0 = Count[IntegerDigits[i^2], 0];
If[nsmall[[n0]] > i^2, nsmall[[n0]] = i^2]];
ReplaceAll[nsmall, Infinity -> "?"] (* Robert Price, Mar 22 2020 *)
CROSSREFS
Cf. A036508 (digits 1), A036509 (2), A036510 (3), A036511 (4), A036512 (5), A036513 (6), A036514 (7), A036515 (8), A036516 (9).
Sequence in context: A151648 A013747 A065447 * A369405 A202055 A185303
KEYWORD
nonn,base
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 08:41 EDT 2024. Contains 372552 sequences. (Running on oeis4.)