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.

A323708 a(n) is the smallest positive number not yet in the sequence that contains both the smallest and largest digits from a(n-1); a(1)=1.

Table of values

n a(n)
1 1
2 10
3 100
4 101
5 102
6 20
7 120
8 200
9 201
10 202
11 203
12 30
13 103
14 130
15 230
16 300
17 301
18 302
19 303
20 304
21 40
22 104
23 140
24 204
25 240
26 340
27 400
28 401
29 402
30 403
31 404
32 405
33 50
34 105
35 150
36 205
37 250
38 305
39 350
40 450
41 500
42 501
43 502
44 503
45 504
46 505
47 506
48 60
49 106
50 160
51 206
52 260
53 306
54 360

List of values

[1, 10, 100, 101, 102, 20, 120, 200, 201, 202, 203, 30, 103, 130, 230, 300, 301, 302, 303, 304, 40, 104, 140, 204, 240, 340, 400, 401, 402, 403, 404, 405, 50, 105, 150, 205, 250, 305, 350, 450, 500, 501, 502, 503, 504, 505, 506, 60, 106, 160, 206, 260, 306, 360]

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

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