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.

A377900 After A121053(n) has been found, a(n) is the smallest candidate for A121053(n+1) that has not been eliminated.

Table of values

n a(n)
1 1
2 1
3 1
4 6
5 6
6 9
7 9
8 9
9 12
10 12
11 12
12 15
13 15
14 15
15 18
16 18
17 18
18 21
19 21
20 21
21 24
22 24
23 24
24 26
25 26
26 28
27 28
28 32
29 32
30 32
31 32
32 34
33 34
34 36
35 36
36 39
37 39
38 39
39 42
40 42
41 42
42 45
43 45
44 45
45 48
46 48
47 48
48 50
49 50
50 52
51 52
52 55
53 55
54 55
55 57
56 57
57 60
58 60
59 60
60 63
61 63
62 63
63 65
64 65
65 68
66 68
67 68
68 70

List of values

[1, 1, 1, 6, 6, 9, 9, 9, 12, 12, 12, 15, 15, 15, 18, 18, 18, 21, 21, 21, 24, 24, 24, 26, 26, 28, 28, 32, 32, 32, 32, 34, 34, 36, 36, 39, 39, 39, 42, 42, 42, 45, 45, 45, 48, 48, 48, 50, 50, 52, 52, 55, 55, 55, 57, 57, 60, 60, 60, 63, 63, 63, 65, 65, 68, 68, 68, 70]

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

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