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.

A067975 a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) 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 1822
7 3658
8 5558
9 6196
10 9679
11 10183
12 11794
13 17852
14 20813
15 28354
16 32193
17 42852
18 53787
19 55044
20 55707
21 55983
22 57636
23 58464
24 61719
25 70209
26 95232
27 96354
28 96921
29 96963
30 101407
31 114223
32 114323
33 133564
34 162293
35 170843

List of values

[2, 7, 43, 136, 367, 1157, 1822, 3658, 5558, 6196, 9679, 10183, 11794, 17852, 20813, 28354, 32193, 42852, 53787, 55044, 55707, 55983, 57636, 58464, 61719, 70209, 95232, 96354, 96921, 96963, 101407, 114223, 114323, 133564, 162293, 170843]