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.

A386243 a(n) is the smallest possible g(k) in a set of increasing numbers g(1) < g(2) < ... < g(k) having Frobenius number n.

Table of values

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

List of values

[3, 5, 5, 7, 4, 7, 5, 9, 7, 9, 5, 9, 8, 11, 10, 11, 7, 13, 6, 9, 11, 10, 7, 13, 11, 11, 8, 13, 7, 13, 9, 13, 14, 13, 11, 13, 12, 13, 11, 17, 8, 17, 12, 17, 14, 16, 9, 19, 11, 17, 14, 17, 10, 13, 9, 17, 15, 17, 11, 18, 15, 19, 16, 15, 12, 16, 16, 18, 11, 17, 10, 19, 17, 17, 18, 18, 15]

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

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