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.

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

Table of values

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

List of values

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