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.

A348445 Irregular triangle read by rows: T(n,k) (n >= 0) is the number of ways of selecting k objects from n objects arranged on a line with no two selected objects having unit separation (i.e. having exactly one object between them).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 3
8 2
9 1
10 4
11 4
12 1
13 5
14 7
15 2
16 1
17 6
18 11
19 6
20 1
21 1
22 7
23 16
24 13
25 3
26 1
27 8
28 22
29 24
30 9
31 1
32 9
33 29
34 40
35 22
36 3
37 1
38 10
39 37
40 62
41 46
42 12
43 1
44 1
45 11
46 46
47 91
48 86
49 34
50 4
51 1
52 12
53 56
54 128
55 148
56 80
57 16
58 1
59 13
60 67
61 174
62 239
63 166
64 50
65 4
66 1
67 14
68 79
69 230
70 367
71 314
72 130
73 20
74 1
75 1
76 15
77 92
78 297
79 541
80 553
81 296
82 70
83 5

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 4, 4, 1, 5, 7, 2, 1, 6, 11, 6, 1, 1, 7, 16, 13, 3, 1, 8, 22, 24, 9, 1, 9, 29, 40, 22, 3, 1, 10, 37, 62, 46, 12, 1, 1, 11, 46, 91, 86, 34, 4, 1, 12, 56, 128, 148, 80, 16, 1, 13, 67, 174, 239, 166, 50, 4, 1, 14, 79, 230, 367, 314, 130, 20, 1, 1, 15, 92, 297, 541, 553, 296, 70, 5]