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.

A265891 a(n) = A099563(A000407(n)); the most significant digit in factorial base representation of (2n+1)! / n!.

Table of values

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

List of values

[1, 1, 2, 1, 3, 8, 2, 6, 1, 3, 10, 1, 5, 14, 1, 5, 16, 1, 5, 15, 1, 4, 12, 1, 3, 9, 28, 2, 6, 19, 1, 3, 11, 35, 2, 6, 19, 1, 3, 10, 30, 1, 4, 14, 44, 2, 6, 20, 61, 2, 8, 25, 1, 3, 10, 31, 1, 3, 11, 35, 1, 4, 12, 38, 1, 4, 12, 39, 1, 4, 12, 39, 1, 3, 11, 36, 1, 3, 10, 33, 102, 3, 9, 28, 89, 2, 7, 23, 74, 1, 6, 19, 59]