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.

A153847 Number of non-isomorphic connected I-graphs I(n,j,k) on 2n vertices (1<=j,k<=Floor[(n-1)/2]).

Table of values

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

List of values

[1, 1, 2, 2, 2, 3, 3, 4, 3, 7, 4, 5, 7, 6, 5, 8, 5, 10, 9, 8, 6, 14, 8, 10, 9, 13, 8, 19, 8, 12, 13, 13, 13, 19, 10, 14, 15, 20, 11, 25, 11, 19, 19, 17, 12, 26, 14, 22, 19, 22, 14, 26, 19, 26, 21, 22, 15, 40, 16, 23, 25, 24, 23, 37, 17, 28, 25, 37, 18, 38, 19, 28, 31, 31, 25, 43, 20]