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.

A213668 Irregular triangle read by rows: T(n,k) is the number of dominating subsets with k vertices of the graph G(n) consisting of a pair of endvertices joined by n internally disjoint paths of length 2 (the n-ary generalized theta graph THETA_{2,2,...2}; n>=1, 1<=k<=n+2).

Table of values

n a(n)
1 1
2 3
3 1
4 0
5 6
6 4
7 1
8 0
9 7
10 10
11 5
12 1
13 0
14 9
15 16
16 15
17 6
18 1
19 0
20 11
21 25
22 30
23 21
24 7
25 1
26 0
27 13
28 36
29 55
30 50
31 28
32 8
33 1
34 0
35 15
36 49
37 91
38 105
39 77
40 36
41 9
42 1
43 0
44 17
45 64
46 140
47 196
48 182
49 112
50 45
51 10
52 1
53 0
54 19
55 81
56 204
57 336
58 378
59 294
60 156
61 55
62 11
63 1

List of values

[1, 3, 1, 0, 6, 4, 1, 0, 7, 10, 5, 1, 0, 9, 16, 15, 6, 1, 0, 11, 25, 30, 21, 7, 1, 0, 13, 36, 55, 50, 28, 8, 1, 0, 15, 49, 91, 105, 77, 36, 9, 1, 0, 17, 64, 140, 196, 182, 112, 45, 10, 1, 0, 19, 81, 204, 336, 378, 294, 156, 55, 11, 1]