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.

A291375 Irregular triangle read by rows: number of maximal irredundant sets of size k in the n-path graph.

Table of values

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

List of values

[0, 1, 0, 2, 0, 1, 1, 0, 0, 4, 0, 0, 5, 1, 0, 0, 2, 6, 0, 0, 0, 12, 1, 0, 0, 0, 8, 9, 0, 0, 0, 1, 25, 1, 0, 0, 0, 0, 28, 12, 0, 0, 0, 0, 12, 44, 1, 0, 0, 0, 0, 2, 68, 16, 0, 0, 0, 0, 0, 48, 73, 1, 0, 0, 0, 0, 0, 14, 150, 20, 0, 0, 0, 0, 0, 1, 155, 112, 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.