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.

A291055 Number of maximal irredundant sets in the n-path graph.

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 6
6 8
7 13
8 17
9 27
10 40
11 57
12 86
13 122
14 184
15 269
16 395
17 582
18 849
19 1255
20 1843
21 2708
22 3982
23 5841
24 8597
25 12631
26 18566
27 27286
28 40082
29 58929
30 86598
31 127279
32 187052
33 274872
34 404001
35 593732
36 872606
37 1282416
38 1884660
39 2769856
40 4070718
41 5982611
42 8792345

List of values

[1, 2, 2, 4, 6, 8, 13, 17, 27, 40, 57, 86, 122, 184, 269, 395, 582, 849, 1255, 1843, 2708, 3982, 5841, 8597, 12631, 18566, 27286, 40082, 58929, 86598, 127279, 187052, 274872, 404001, 593732, 872606, 1282416, 1884660, 2769856, 4070718, 5982611, 8792345]

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

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