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.

A067711 a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1.

Table of values

n a(n)
0 1
1 16
2 169
3 1296
4 12769
5 237169
6 1073296
7 10329796
8 109327936
9 1353209796
10 10193527369
11 102179958336
12 1003931857296
13 10023359708961
14 100035723189796
15 1000257893937316
16 10002783993738561
17 100018367973835249

List of values

[1, 16, 169, 1296, 12769, 237169, 1073296, 10329796, 109327936, 1353209796, 10193527369, 102179958336, 1003931857296, 10023359708961, 100035723189796, 1000257893937316, 10002783993738561, 100018367973835249]