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.

A246272 Starting from n, the number of iterations of A003961 needed before the result has only prime factors of the form 4k+1 (a(1) = 0). [Where A003961(n) shifts the prime factorization of n one step towards larger primes].

Table of values

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

List of values

[0, 2, 1, 2, 0, 5, 2, 2, 1, 9, 1, 5, 0, 2, 4, 2, 0, 5, 2, 9, 8, 2, 1, 5, 0, 6, 1, 2, 0, 23, 1, 2, 1, 5, 3, 5, 0, 2, 1, 9, 0, 49, 2, 2, 4, 9, 1, 5, 2, 9, 5, 6, 0, 5, 7, 2, 4, 2, 1, 23, 0, 2, 8, 2, 0, 5, 2, 5, 1, 9, 1, 5, 0, 6, 4, 2, 2, 23, 2, 9, 1, 5, 1, 49, 0, 2, 8, 2, 0, 23, 6, 9, 1, 6, 4, 5, 0, 2, 1, 9]