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.

A335050 Array read by descending antidiagonals, T(n,k) is the number of nodes in the pill tree with initial conditions (n,k), for n and k >= 0.

Table of values

n a(n)
0 1
1 2
2 3
3 3
4 7
5 8
6 4
7 12
8 21
9 22
10 5
11 18
12 40
13 63
14 64
15 6
16 25
17 66
18 130
19 195
20 196
21 7
22 33
23 100
24 231
25 427
26 624
27 625
28 8
29 42
30 143
31 375
32 803
33 1428
34 2054
35 2055
36 9
37 52
38 196
39 572
40 1376
41 2805
42 4860
43 6916
44 6917
45 10
46 63
47 260
48 833
49 2210
50 5016
51 9877
52 16794
53 23712
54 23713

List of values

[1, 2, 3, 3, 7, 8, 4, 12, 21, 22, 5, 18, 40, 63, 64, 6, 25, 66, 130, 195, 196, 7, 33, 100, 231, 427, 624, 625, 8, 42, 143, 375, 803, 1428, 2054, 2055, 9, 52, 196, 572, 1376, 2805, 4860, 6916, 6917, 10, 63, 260, 833, 2210, 5016, 9877, 16794, 23712, 23713]