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.

A203647 T(n,k) = number of arrays of n 0..k integers with new values introduced in order 0..k but otherwise unconstrained. Array read by antidiagonals.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 4
7 1
8 2
9 5
10 8
11 1
12 2
13 5
14 14
15 16
16 1
17 2
18 5
19 15
20 41
21 32
22 1
23 2
24 5
25 15
26 51
27 122
28 64
29 1
30 2
31 5
32 15
33 52
34 187
35 365
36 128
37 1
38 2
39 5
40 15
41 52
42 202
43 715
44 1094
45 256
46 1
47 2
48 5
49 15
50 52
51 203
52 855
53 2795
54 3281
55 512
56 1
57 2
58 5
59 15
60 52
61 203
62 876
63 3845
64 11051
65 9842
66 1024
67 1
68 2
69 5
70 15
71 52
72 203
73 877

List of values

[1, 1, 2, 1, 2, 4, 1, 2, 5, 8, 1, 2, 5, 14, 16, 1, 2, 5, 15, 41, 32, 1, 2, 5, 15, 51, 122, 64, 1, 2, 5, 15, 52, 187, 365, 128, 1, 2, 5, 15, 52, 202, 715, 1094, 256, 1, 2, 5, 15, 52, 203, 855, 2795, 3281, 512, 1, 2, 5, 15, 52, 203, 876, 3845, 11051, 9842, 1024, 1, 2, 5, 15, 52, 203, 877]