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.

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

Table of values

n a(n)
0 1
1 5
2 25
3 105
4 678
5 2685
6 6631
7 17248
8 48056
9 109016
10 255085
11 576468
12 1026598
13 2161819
14 4793623
15 10107506
16 21624889
17 46584891
18 100042239
19 215671305
20 464309988
21 1000305876
22 2156229901
23 4642492109
24 10000266599

List of values

[1, 5, 25, 105, 678, 2685, 6631, 17248, 48056, 109016, 255085, 576468, 1026598, 2161819, 4793623, 10107506, 21624889, 46584891, 100042239, 215671305, 464309988, 1000305876, 2156229901, 4642492109, 10000266599]