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.

A228360 Table read by antidiagonals: T(l,L) is the number of all possible covers of L-length line segment by l-length line segments with allowed gaps < l.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.