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.

A231719 After zero, a(n) = largest m such that m! divides the difference between successive nodes A219666(n-1) and A219666(n) in the infinite trunk of the factorial beanstalk.

Table of values

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

List of values

[0, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 2, 1, 1, 3, 2, 2, 1, 3, 1, 2, 1, 3, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 3, 2, 2, 1, 3, 1, 2, 1, 3, 1, 1, 1, 3, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 1, 3, 1, 1, 1, 3, 2, 3, 2, 2, 1, 2, 1, 2, 1, 3, 1, 1, 1, 3, 2, 3, 2, 2, 1, 2, 3, 2, 1, 1, 1]