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.

A367366 a(n) = smallest k such that the commas sequence (cf. A121805) with initial term k contains n.

Table of values

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

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 1, 13, 14, 15, 16, 17, 18, 19, 20, 21, 20, 10, 2, 25, 26, 27, 28, 29, 30, 31, 32, 30, 21, 1, 3, 37, 38, 39, 40, 41, 42, 43, 40, 31, 20, 13, 4, 49, 50, 51, 52, 53, 54, 50, 41, 32, 10, 14, 60, 5, 62, 63, 64, 65, 60, 51, 42, 30, 70, 2, 15, 6, 74, 75]

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

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