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.

A132892 Square array T(m,n) read by antidiagonals; T(m,n) is the number of equivalence classes in the set of sequences of n nonnegative integers that sum to m, generated by the equivalence relation defined in the following manner: we write a sequence in the form a[1]0a[2]0...0a[p], where each a[i] is a (possibly empty) sequence of positive integers; two sequences in this form, a[1]0a[2]0...0a[p] and b[1]0b[2]0...0b[q] are said to be equivalent if p=q and b[1],b[2],...,b[q] is a cyclic permutation of a[1],a[2],...a[p].

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 3
9 3
10 1
11 1
12 4
13 5
14 3
15 1
16 1
17 5
18 9
19 7
20 4
21 1
22 1
23 6
24 13
25 14
26 10
27 4
28 1
29 1
30 7
31 19
32 25
33 22
34 12
35 5
36 1
37 1
38 8
39 25
40 41
41 42
42 30
43 15
44 5
45 1
46 1
47 9
48 33
49 63
50 79
51 66
52 43
53 19
54 6
55 1
56 1
57 10
58 41
59 92
60 131
61 132
62 99
63 55
64 22
65 6
66 1
67 1
68 11
69 51
70 129
71 213
72 245
73 217
74 143
75 73
76 26
77 7
78 1
79 1
80 12
81 61
82 175
83 325
84 428
85 429
86 335
87 201
88 91
89 31
90 7
91 1

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 5, 3, 1, 1, 5, 9, 7, 4, 1, 1, 6, 13, 14, 10, 4, 1, 1, 7, 19, 25, 22, 12, 5, 1, 1, 8, 25, 41, 42, 30, 15, 5, 1, 1, 9, 33, 63, 79, 66, 43, 19, 6, 1, 1, 10, 41, 92, 131, 132, 99, 55, 22, 6, 1, 1, 11, 51, 129, 213, 245, 217, 143, 73, 26, 7, 1, 1, 12, 61, 175, 325, 428, 429, 335, 201, 91, 31, 7, 1]