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.

A302654 Number of minimum total dominating sets in the n-path graph.

Table of values

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

List of values

[0, 1, 2, 1, 1, 4, 3, 1, 2, 9, 4, 1, 3, 16, 5, 1, 4, 25, 6, 1, 5, 36, 7, 1, 6, 49, 8, 1, 7, 64, 9, 1, 8, 81, 10, 1, 9, 100, 11, 1, 10, 121, 12, 1, 11, 144, 13, 1, 12, 169, 14, 1, 13, 196, 15, 1, 14, 225, 16, 1, 15, 256, 17, 1, 16, 289, 18, 1, 17, 324, 19, 1, 18, 361, 20, 1]