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.

A230406 a(n) = A034968(A219666(n)); after zero, the differences between successive nodes in the infinite trunk of the factorial beanstalk (A219666).

Table of values

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

List of values

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