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.

A309524 Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with longest path having k nodes, (1 <= k <= n).

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 0
6 2
7 0
8 0
9 1
10 5
11 0
12 0
13 1
14 2
15 18
16 0
17 0
18 1
19 3
20 17
21 91
22 0
23 0
24 1
25 3
26 29
27 86
28 734
29 0
30 0
31 1
32 4
33 42
34 176
35 864
36 10030
37 0
38 0
39 1
40 4
41 64
42 309
43 2032
44 10243
45 248427

List of values

[1, 0, 1, 0, 0, 2, 0, 0, 1, 5, 0, 0, 1, 2, 18, 0, 0, 1, 3, 17, 91, 0, 0, 1, 3, 29, 86, 734, 0, 0, 1, 4, 42, 176, 864, 10030, 0, 0, 1, 4, 64, 309, 2032, 10243, 248427]