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.

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

Table of values

n a(n)
0 2
1 7
2 43
3 136
4 367
5 1157
6 3658
7 10183
8 32193
9 101407
10 320537
11 1001842
12 3166463
13 10001923
14 31627114
15 100017313
16 316599084
17 1000104687
18 3162331407
19 10000483663

List of values

[2, 7, 43, 136, 367, 1157, 3658, 10183, 32193, 101407, 320537, 1001842, 3166463, 10001923, 31627114, 100017313, 316599084, 1000104687, 3162331407, 10000483663]