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.

A346915 Decimal expansion of the limit as N->oo of the mean number of mems per forest taken by Knuth's algorithm O when generating the rooted forests of N vertices.

Table of values

n a(n)
1 3
2 5
3 3
4 3
5 9
6 2
7 6
8 3
9 9
10 8
11 0
12 2
13 3
14 7
15 2
16 1
17 7
18 9
19 6
20 9
21 1
22 5
23 9
24 9
25 9
26 7
27 5
28 6
29 9
30 0
31 0
32 2
33 7
34 2
35 7
36 8
37 4
38 5
39 1
40 0
41 8
42 6
43 7
44 6
45 0
46 3
47 2
48 5
49 7
50 3
51 7
52 7
53 2
54 9
55 1
56 8
57 0
58 6
59 7
60 3
61 4
62 5
63 8
64 9
65 4
66 6
67 0
68 3
69 4
70 1
71 2
72 0
73 6
74 2
75 1
76 8
77 6
78 9
79 2
80 4
81 9
82 4
83 1
84 9
85 7
86 5
87 0
88 7
89 7
90 2
91 5
92 1
93 2
94 6
95 3
96 1
97 2
98 7
99 2
100 8
101 7
102 3
103 0
104 5
105 5

List of values

[3, 5, 3, 3, 9, 2, 6, 3, 9, 8, 0, 2, 3, 7, 2, 1, 7, 9, 6, 9, 1, 5, 9, 9, 9, 7, 5, 6, 9, 0, 0, 2, 7, 2, 7, 8, 4, 5, 1, 0, 8, 6, 7, 6, 0, 3, 2, 5, 7, 3, 7, 7, 2, 9, 1, 8, 0, 6, 7, 3, 4, 5, 8, 9, 4, 6, 0, 3, 4, 1, 2, 0, 6, 2, 1, 8, 6, 9, 2, 4, 9, 4, 1, 9, 7, 5, 0, 7, 7, 2, 5, 1, 2, 6, 3, 1, 2, 7, 2, 8, 7, 3, 0, 5, 5]