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.

A246271 Starting from A003961(n), the number of additional iterations of A003961 required for the result to be of the form 4k+1.

Table of values

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

List of values

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