|
Search: id:A080438
|
|
|
| A080438 |
|
For n < 10, a(n) = n^2. For n > 10, let m = n^2. If m has k digits then a(n) = smallest square obtained by inserting digits between every pair of digits of m. There are (k-1) places where digit insertion takes place and a(n) contains at least 2k-1 digits. |
|
+0
1
|
| |
|
|
|
|
Search completed in 0.002 seconds
|
