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.

A277795 Number of trees with n unlabeled nodes such that all nodes with degree >2 lie on a single path with length equal to the tree's diameter.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 6
7 11
8 23
9 47
10 103
11 223
12 503
13 1132
14 2602
15 5986
16 13922
17 32433
18 75994
19 178354
20 419945
21 990134
22 2339033
23 5531459
24 13097217
25 31036235
26 73607165
27 174677138
28 414768535
29 985315906
30 2341687487
31 5567158277
32 13239573207
33 31494089609
34 74935197166
35 178332248260
36 424473745066

List of values

[1, 1, 1, 1, 2, 3, 6, 11, 23, 47, 103, 223, 503, 1132, 2602, 5986, 13922, 32433, 75994, 178354, 419945, 990134, 2339033, 5531459, 13097217, 31036235, 73607165, 174677138, 414768535, 985315906, 2341687487, 5567158277, 13239573207, 31494089609, 74935197166, 178332248260, 424473745066]

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

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