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.

A252459 a(n) = Number of iterations of A003961 starting from n which are needed before the result is one of the numbers in A251726. a(1) = 0 by convention.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 1
11 0
12 0
13 0
14 2
15 0
16 0
17 0
18 0
19 0
20 1
21 0
22 2
23 0
24 0
25 0
26 2
27 0
28 2
29 0
30 1
31 0
32 0
33 1
34 2
35 0
36 0
37 0
38 3
39 1
40 1
41 0
42 2
43 0
44 2
45 0
46 3
47 0
48 0
49 0
50 1
51 1
52 2
53 0
54 0
55 0
56 2
57 1
58 3
59 0
60 1
61 0
62 3
63 0
64 0
65 0
66 2
67 0
68 2
69 2
70 2
71 0
72 0
73 0
74 3
75 0
76 3
77 0
78 2
79 0
80 1
81 0
82 4
83 0
84 2
85 0
86 4
87 2
88 2
89 0
90 1
91 0
92 3
93 2
94 4
95 0
96 0
97 0
98 2
99 1
100 1
101 0
102 2
103 0
104 2
105 0
106 4
107 0
108 0
109 0
110 2
111 2
112 2
113 0
114 3
115 0
116 3
117 1
118 4
119 0
120 1

List of values

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