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.

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

Table of values

n a(n)
1 3
2 13
3 31
4 103
5 1013
6 1031
7 1103
8 1301
9 3011
10 10103
11 10301
12 11003
13 13001
14 30011
15 100103
16 103001
17 1000133
18 1000313
19 1001303
20 1003103
21 1010033
22 1013003
23 1030031
24 1031003
25 1033001
26 1100303
27 1300031
28 1330001

List of values

[3, 13, 31, 103, 1013, 1031, 1103, 1301, 3011, 10103, 10301, 11003, 13001, 30011, 100103, 103001, 1000133, 1000313, 1001303, 1003103, 1010033, 1013003, 1030031, 1031003, 1033001, 1100303, 1300031, 1330001]