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.

A213725 a(n)=0 if n is in the infinite trunk of Carl White's beanstalk (i.e., in A179016), otherwise 1 + number of steps to reach the farthest leaf in that finite branch of the beanstalk.

Table of values

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

List of values

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