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.

A195979 a(n) = Sum_{k=0..n} T(n,k), where T(n,k) is the number of rooted labeled trees with n nodes whose maximal decreasing subtree has k nodes.

Table of values

n a(n)
0 1
1 2
2 8
3 53
4 497
5 6027
6 89595
7 1576682
8 32047986
9 738772383
10 19042778713
11 542704904381
12 16944005908637
13 575128775147734
14 21086473359281088
15 830481043455973053
16 34967280863073327597
17 1567405219938012472847
18 74521905471659239870631
19 3745801599865304794344662

List of values

[1, 2, 8, 53, 497, 6027, 89595, 1576682, 32047986, 738772383, 19042778713, 542704904381, 16944005908637, 575128775147734, 21086473359281088, 830481043455973053, 34967280863073327597, 1567405219938012472847, 74521905471659239870631, 3745801599865304794344662]

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

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