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.

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

Table of values

n a(n)
1 1
2 3
3 6
4 13
5 24
6 49
7 93
8 190
9 381
10 803
11 1703
12 3755
13 8401
14 19338
15 45275
16 108229
17 262604
18 647083
19 1613941
20 4072198
21 10374138
22 26663390
23 69056163
24 180098668
25 472604314
26 1247159936
27 3307845730
28 8814122981
29 23585720703
30 63359160443
31 170815541708
32 462049250165

List of values

[1, 3, 6, 13, 24, 49, 93, 190, 381, 803, 1703, 3755, 8401, 19338, 45275, 108229, 262604, 647083, 1613941, 4072198, 10374138, 26663390, 69056163, 180098668, 472604314, 1247159936, 3307845730, 8814122981, 23585720703, 63359160443, 170815541708, 462049250165]