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.

A350716 a(n) is the minimum number of vertices of degree 3 over all 3-collapsible graphs with n vertices.

Table of values

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

List of values

[4, 4, 4, 4, 4, 4, 4, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 10, 10, 10, 11, 11, 12, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 20, 20, 20, 21, 21, 22, 22, 22, 23, 23, 24, 24, 24, 25, 25, 26, 26, 26, 27, 27, 28, 28, 28, 29, 29, 30]

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

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