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.

A067974 a(n+1) is the smallest cube > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=1.

Table of values

n a(n)
0 1
1 125
2 512
3 15625
4 1157625
5 311665752
6 19356769125
7 291566137591
8 5131167956992
9 110979523759616
10 1295599371716096
11 16597961902739125
12 191569168079975232
13 982095927615711936
14 1081935177662959192
15 1091762925561991873
16 1196109781753695229
17 1293596679780115192

List of values

[1, 125, 512, 15625, 1157625, 311665752, 19356769125, 291566137591, 5131167956992, 110979523759616, 1295599371716096, 16597961902739125, 191569168079975232, 982095927615711936, 1081935177662959192, 1091762925561991873, 1196109781753695229, 1293596679780115192]