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.

A263831 Values of k such that the number of rooted trees with k nodes (A000081(k)) is odd.

Table of values

n a(n)
1 1
2 2
3 5
4 8
5 10
6 14
7 15
8 16
9 17
10 18
11 22
12 23
13 25
14 27
15 28
16 30
17 33
18 35
19 38
20 40
21 42
22 49
23 50
24 56
25 61
26 64
27 65
28 67
29 68
30 71
31 73
32 74
33 75
34 76
35 77
36 78
37 82
38 84
39 87
40 93
41 98
42 99
43 104
44 108
45 113
46 114
47 115
48 117
49 118
50 119
51 120
52 121
53 122
54 123
55 124
56 127
57 128
58 135
59 137
60 138
61 139

List of values

[1, 2, 5, 8, 10, 14, 15, 16, 17, 18, 22, 23, 25, 27, 28, 30, 33, 35, 38, 40, 42, 49, 50, 56, 61, 64, 65, 67, 68, 71, 73, 74, 75, 76, 77, 78, 82, 84, 87, 93, 98, 99, 104, 108, 113, 114, 115, 117, 118, 119, 120, 121, 122, 123, 124, 127, 128, 135, 137, 138, 139]