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.

A278515 Number of steps required to iterate map k -> A255131(k) when starting from k = (A000196(n)+1)^2 before n is reached, or 0 if n is not reached.

Table of values

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

List of values

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