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.

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

Table of values

n a(n)
0 1
1 5
2 8
3 25
4 105
5 678
6 2685
7 6631
8 17248
9 48056
10 109016
11 255085
12 576468
13 993996
14 1026598
15 1029697
16 1061509
17 1089598
18 1231339
19 1374358
20 1753291
21 1832389
22 1896319
23 2161819
24 2162446
25 2163199
26 2231416
27 2263201
28 2264893
29 2674003

List of values

[1, 5, 8, 25, 105, 678, 2685, 6631, 17248, 48056, 109016, 255085, 576468, 993996, 1026598, 1029697, 1061509, 1089598, 1231339, 1374358, 1753291, 1832389, 1896319, 2161819, 2162446, 2163199, 2231416, 2263201, 2264893, 2674003]