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.

A219666 The infinite trunk of factorial expansion beanstalk. The only infinite sequence such that a(n-1) = a(n) - sum of digits in factorial expansion of a(n).

Table of values

n a(n)
0 0
1 1
2 2
3 5
4 7
5 10
6 12
7 17
8 23
9 25
10 28
11 30
12 35
13 40
14 46
15 48
16 52
17 57
18 63
19 70
20 74
21 79
22 85
23 92
24 97
25 102
26 109
27 119
28 121
29 124
30 126
31 131
32 136
33 142
34 144
35 148
36 153
37 159
38 166
39 170
40 175
41 181
42 188
43 193
44 198
45 204
46 213
47 221
48 228
49 238
50 240
51 244
52 249
53 255
54 262
55 266
56 271
57 277

List of values

[0, 1, 2, 5, 7, 10, 12, 17, 23, 25, 28, 30, 35, 40, 46, 48, 52, 57, 63, 70, 74, 79, 85, 92, 97, 102, 109, 119, 121, 124, 126, 131, 136, 142, 144, 148, 153, 159, 166, 170, 175, 181, 188, 193, 198, 204, 213, 221, 228, 238, 240, 244, 249, 255, 262, 266, 271, 277]