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.

A182258 Least number k such that there exists a simple graph on k vertices having precisely n spanning trees.

Table of values

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

List of values

[3, 4, 5, 6, 7, 4, 5, 10, 5, 5, 13, 6, 6, 4, 7, 8, 7, 5, 5, 22, 8, 5, 9, 8, 7, 6, 6, 6, 9, 6, 7, 10, 6, 6, 7, 10, 7, 5, 7, 8, 7, 7, 5, 7, 11, 6, 7, 7, 7, 6, 8, 6, 6, 6, 8, 8, 8, 6, 6, 9, 7, 6, 8, 6, 8, 7, 6, 8, 9, 7, 7, 9, 5, 7, 9, 9, 7, 7, 6]

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

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