cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A277442 Least number k such that k^2 can be obtained from k by inserting internal (but not necessarily contiguous) digits in n different ways.

Table of values

n a(n)
0 0
1 10
2 101
3 100
4 10006
5 950005
6 1001
7 9569005
8 100105
9 100500
10 1000
11 95370001
12 1000201
13 102100005
14 9957800
15 100006
16 9500005
17 1100005
18 100100
19 1010005
20 10001
21 10000096
22 10005005
23 1000105
24 1001005
25 999578000
26 1002600005
27 12500100
28 100010505
29 1050500005
30 1000500

List of values

[0, 10, 101, 100, 10006, 950005, 1001, 9569005, 100105, 100500, 1000, 95370001, 1000201, 102100005, 9957800, 100006, 9500005, 1100005, 100100, 1010005, 10001, 10000096, 10005005, 1000105, 1001005, 999578000, 1002600005, 12500100, 100010505, 1050500005, 1000500]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.