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.

A379785 For n >= 2, let b(n) = 1 if A379652(n) is 3 mod 4, 0 if A379652(n) is 1 mod 4; form the RUNS transform of {b(n), n >= 2}.

Table of values

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

List of values

[1, 8, 1, 1, 2, 1, 2, 3, 1, 3, 2, 4, 1, 1, 1, 2, 1, 3, 2, 1, 3, 1, 1, 5, 2, 2, 3, 3, 4, 4, 1, 1, 3, 2, 1, 2, 1, 3, 1, 6, 1, 3, 2, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 4, 2, 1, 1, 1, 1, 15, 1, 3, 3, 1, 5, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 4, 3, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 4, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 7, 2, 2]