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.

A294525 Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with k center nodes.

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 2
9 0
10 2
11 8
12 4
13 4
14 0
15 5
16 29
17 19
18 18
19 18
20 0
21 28
22 180
23 84
24 119
25 118
26 129
27 0
28 223
29 1463
30 821
31 1055
32 1426
33 1390
34 1811
35 0
36 3151
37 20093
38 12485
39 17297
40 24853
41 29987
42 30515
43 46177
44 0
45 79673
46 474063
47 343572
48 486446
49 763319
50 1015304
51 1247381
52 1296986
53 2235630
54 0
55 3853870

List of values

[1, 0, 1, 1, 0, 1, 2, 2, 0, 2, 8, 4, 4, 0, 5, 29, 19, 18, 18, 0, 28, 180, 84, 119, 118, 129, 0, 223, 1463, 821, 1055, 1426, 1390, 1811, 0, 3151, 20093, 12485, 17297, 24853, 29987, 30515, 46177, 0, 79673, 474063, 343572, 486446, 763319, 1015304, 1247381, 1296986, 2235630, 0, 3853870]

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

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