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.

A377069 Triangle read by rows: T(n,k) is the number of (k+1)-vertex dominating sets of the (n+1)-path graph that include the first vertex.

Table of values

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

List of values

[1, 1, 1, 0, 2, 1, 0, 2, 3, 1, 0, 1, 5, 4, 1, 0, 0, 5, 9, 5, 1, 0, 0, 3, 13, 14, 6, 1, 0, 0, 1, 13, 26, 20, 7, 1, 0, 0, 0, 9, 35, 45, 27, 8, 1, 0, 0, 0, 4, 35, 75, 71, 35, 9, 1, 0, 0, 0, 1, 26, 96, 140, 105, 44, 10, 1, 0, 0, 0, 0, 14, 96, 216, 238, 148, 54, 11, 1]

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

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