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.

A288265 Triangle read by rows: T(n,k) is the number of labeled connected planar graphs on n vertices and k edges.

Table of values

n a(n)
1 1
2 1
3 3
4 1
5 16
6 15
7 6
8 1
9 125
10 222
11 205
12 120
13 45
14 10
15 1296
16 3660
17 5700
18 6165
19 4935
20 2937
21 1125
22 195
23 16807
24 68295
25 156555
26 258125
27 330456
28 334530
29 254275
30 131985
31 40950
32 5712
33 262144
34 1436568
35 4483360
36 10230360
37 18528216
38 27261192
39 31761744
40 27958920
41 17666320
42 7513632
43 1922760
44 223440
45 4782969
46 33779340
47 136368414
48 405918324
49 970196283
50 1910996136
51 3058785990
52 3866563764
53 3754432899
54 2724326136
55 1425385584
56 507370500
57 109907280
58 10929600

List of values

[1, 1, 3, 1, 16, 15, 6, 1, 125, 222, 205, 120, 45, 10, 1296, 3660, 5700, 6165, 4935, 2937, 1125, 195, 16807, 68295, 156555, 258125, 330456, 334530, 254275, 131985, 40950, 5712, 262144, 1436568, 4483360, 10230360, 18528216, 27261192, 31761744, 27958920, 17666320, 7513632, 1922760, 223440, 4782969, 33779340, 136368414, 405918324, 970196283, 1910996136, 3058785990, 3866563764, 3754432899, 2724326136, 1425385584, 507370500, 109907280, 10929600]

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

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