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.

A069713 As a square array T(n,k) by antidiagonals, number of ways of partitioning k into up to n parts each no more than 5, or into up to 5 parts each no more than n; as a triangle t(n,k), number of ways of partitioning n into exactly k parts each no more than 6 (i.e., of arranging k indistinguishable standard dice to produce a total of n).

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 2, 1, 1, 0, 1, 3, 3, 2, 1, 1, 0, 0, 3, 4, 3, 2, 1, 1, 0, 0, 3, 5, 5, 3, 2, 1, 1, 0, 0, 2, 6, 6, 5, 3, 2, 1, 1, 0, 0, 2, 6, 8, 7, 5, 3, 2, 1, 1, 0, 0, 1, 6, 9, 9, 7, 5, 3, 2, 1, 1, 0, 0, 1, 6, 11, 11, 10, 7, 5, 3, 2, 1, 1, 0, 0, 0, 5, 11, 14, 12, 10, 7, 5]