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.

A005197 a(n) = Sum_t t*F(n,t), where F(n,t) (see A033185) is the number of rooted forests with n (unlabeled) nodes and exactly t rooted trees.

Table of values

n a(n)
1 1
2 3
3 7
4 17
5 39
6 96
7 232
8 583
9 1474
10 3797
11 9864
12 25947
13 68738
14 183612
15 493471
16 1334143
17 3624800
18 9893860
19 27113492
20 74577187
21 205806860
22 569678759
23 1581243203
24 4400193551
25 12273287277
26 34307646762
27 96093291818
28 269654004899
29 758014312091
30 2134300171031

List of values

[1, 3, 7, 17, 39, 96, 232, 583, 1474, 3797, 9864, 25947, 68738, 183612, 493471, 1334143, 3624800, 9893860, 27113492, 74577187, 205806860, 569678759, 1581243203, 4400193551, 12273287277, 34307646762, 96093291818, 269654004899, 758014312091, 2134300171031]