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.

A228693 Largest number of maximal independent sets of nodes in any tree on n nodes.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 4
6 5
7 8
8 9
9 16
10 17
11 32
12 33
13 64
14 65
15 128
16 129
17 256
18 257
19 512
20 513
21 1024
22 1025
23 2048
24 2049
25 4096
26 4097
27 8192
28 8193
29 16384
30 16385
31 32768
32 32769
33 65536
34 65537
35 131072
36 131073
37 262144
38 262145
39 524288
40 524289
41 1048576
42 1048577
43 2097152
44 2097153
45 4194304
46 4194305
47 8388608
48 8388609
49 16777216
50 16777217

List of values

[1, 1, 2, 2, 3, 4, 5, 8, 9, 16, 17, 32, 33, 64, 65, 128, 129, 256, 257, 512, 513, 1024, 1025, 2048, 2049, 4096, 4097, 8192, 8193, 16384, 16385, 32768, 32769, 65536, 65537, 131072, 131073, 262144, 262145, 524288, 524289, 1048576, 1048577, 2097152, 2097153, 4194304, 4194305, 8388608, 8388609, 16777216, 16777217]

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

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