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.

A119262 Number of B-trees of order infinity with n leaves, where a(n) = Sum_{k=1..floor(n/2)} a(k)*C(n-k-1,n-2*k) for n >= 2, with a(0)=0, a(1)=1.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 2
5 3
6 5
7 8
8 14
9 25
10 46
11 85
12 158
13 294
14 548
15 1022
16 1908
17 3567
18 6683
19 12556
20 23669
21 44781
22 85046
23 162122
24 310157
25 595322
26 1146057
27 2212004
28 4278908
29 8292738
30 16097018
31 31286456
32 60873574
33 118543329
34 231009934
35 450434739
36 878687665

List of values

[0, 1, 1, 1, 2, 3, 5, 8, 14, 25, 46, 85, 158, 294, 548, 1022, 1908, 3567, 6683, 12556, 23669, 44781, 85046, 162122, 310157, 595322, 1146057, 2212004, 4278908, 8292738, 16097018, 31286456, 60873574, 118543329, 231009934, 450434739, 878687665]