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.

A231723 a(n) = the difference between the n-th node of the infinite trunk of the factorial beanstalk (A219666(n)) and the smallest integer (A219653(n)) which is as many A219651-iteration steps distanced from the root (zero); a(n) = A219666(n) - A219653(n).

Table of values

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

List of values

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