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.

A065297 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)=1.

Table of values

n a(n)
0 1
1 4
2 13
3 36
4 113
5 487
6 1036
7 3214
8 10456
9 36786
10 100963
11 319656
12 1001964
13 3165969
14 10001786
15 31626854
16 100013919
17 316256807
18 1000029656
19 3162322481
20 10000115537

List of values

[1, 4, 13, 36, 113, 487, 1036, 3214, 10456, 36786, 100963, 319656, 1001964, 3165969, 10001786, 31626854, 100013919, 316256807, 1000029656, 3162322481, 10000115537]