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.

A240315 Triangular array read by rows: T(n,k) is the number of compositions of n into exactly k parts in which no part is unique (each part occurs at least twice).

Table of values

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

List of values

[1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 6, 0, 1, 0, 0, 0, 0, 0, 10, 0, 1, 0, 0, 1, 0, 7, 10, 15, 0, 1, 0, 0, 0, 1, 0, 10, 20, 21, 0, 1, 0, 0, 1, 0, 12, 1, 30, 35, 28, 0, 1, 0, 0, 0, 0, 0, 20, 0, 56, 56, 36, 0, 1, 0, 0, 1, 1, 13, 10, 126, 21, 98, 84, 45, 0, 1]