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.

A333311 a(n) is the total number of leaves of a binary tree of depth n on a square grid where each parent-node branches out in the two directions closest to the direction of the edge from which it sprang, either along the grid for even generations or across for odd generations ('L-toothpick'), yet only if the child-nodes' coordinates are not occupied already.

Table of values

n a(n)
1 2
2 4
3 7
4 12
5 19
6 29
7 41
8 56
9 71
10 90
11 109
12 133
13 155
14 183
15 209
16 242
17 271
18 309
19 340
20 384
21 418
22 466
23 505
24 555
25 600
26 651
27 703
28 758
29 813
30 874
31 931
32 999
33 1058
34 1133
35 1195
36 1277
37 1343
38 1432
39 1502
40 1597
41 1671
42 1771
43 1849
44 1954
45 2036
46 2142

List of values

[2, 4, 7, 12, 19, 29, 41, 56, 71, 90, 109, 133, 155, 183, 209, 242, 271, 309, 340, 384, 418, 466, 505, 555, 600, 651, 703, 758, 813, 874, 931, 999, 1058, 1133, 1195, 1277, 1343, 1432, 1502, 1597, 1671, 1771, 1849, 1954, 2036, 2142]

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

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