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.

A302095 a(n) is the smallest positive integer not yet in the increasing sequence that is obtained when the largest digit from a(n-1) is deleted and the remaining digits are permuted such that no digit in a(n) has the same position it had in a(n-1) (counting from left to right). No repeated digits allowed; a(1)=10.

Table of values

n a(n)
1 10
2 230
3 402
4 520
5 602
6 720
7 802
8 920
9 1023
10 2104
11 3012
12 4120
13 5012
14 6120
15 7012
16 8120
17 9012
18 12034
19 20153
20 31024
21 50132
22 61023
23 70132
24 81023
25 90132
26 120435
27 201346
28 310254
29 401326
30 510234
31 601342
32 710234
33 801342
34 910234
35 1023456
36 2104375
37 3012456
38 4103275
39 5012346
40 7103254

List of values

[10, 230, 402, 520, 602, 720, 802, 920, 1023, 2104, 3012, 4120, 5012, 6120, 7012, 8120, 9012, 12034, 20153, 31024, 50132, 61023, 70132, 81023, 90132, 120435, 201346, 310254, 401326, 510234, 601342, 710234, 801342, 910234, 1023456, 2104375, 3012456, 4103275, 5012346, 7103254]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.