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.

A067714 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)=4.

Table of values

n a(n)
0 4
1 49
2 1849
3 18496
4 134689
5 1338649
6 13380964
7 103693489
8 1036389249
9 10283379649
10 102743968369
11 1003687392964
12 10026487930369
13 100038463697929
14 1000274339968996
15 10003462899739969
16 100234979989639056

List of values

[4, 49, 1849, 18496, 134689, 1338649, 13380964, 103693489, 1036389249, 10283379649, 102743968369, 1003687392964, 10026487930369, 100038463697929, 1000274339968996, 10003462899739969, 100234979989639056]