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.

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

Table of values

n a(n)
0 1
1 4
2 13
3 14
4 31
5 36
6 54
7 96
8 113
9 311
10 487
11 854
12 1036
13 1277
14 1646
15 3214
16 8351
17 10456
18 11414
19 11536
20 11563
21 17606
22 17813
23 30287
24 36786
25 41544
26 54927
27 56547
28 56586
29 57363
30 62469
31 62634
32 72813
33 72897
34 76944
35 78345
36 95061
37 97944
38 100963
39 101944

List of values

[1, 4, 13, 14, 31, 36, 54, 96, 113, 311, 487, 854, 1036, 1277, 1646, 3214, 8351, 10456, 11414, 11536, 11563, 17606, 17813, 30287, 36786, 41544, 54927, 56547, 56586, 57363, 62469, 62634, 72813, 72897, 76944, 78345, 95061, 97944, 100963, 101944]