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.

A334872 Number of steps needed to reach either 1 or one of the "Fermi-Dirac primes" (A050376) when starting from n and iterating with A334870.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 2, 0, 0, 1, 0, 4, 2, 1, 0, 3, 0, 1, 2, 8, 0, 3, 0, 1, 2, 1, 4, 2, 0, 1, 2, 5, 0, 3, 0, 16, 4, 1, 0, 2, 0, 1, 2, 32, 0, 3, 4, 9, 2, 1, 0, 6, 0, 1, 8, 2, 4, 3, 0, 64, 2, 5, 0, 3, 0, 1, 2, 128, 8, 3, 0, 4, 0, 1, 0, 10, 4, 1, 2, 17, 0, 5, 8, 256, 2, 1, 4, 3, 0, 1, 16, 2, 0, 3, 0, 33, 6]