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.

A230426 a(n)=0 if n is in the infinite trunk of factorial beanstalk (in A219666), otherwise the number of terminal nodes (leaves) in that finite branch of the beanstalk.

Table of values

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

List of values

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