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.

A174793 Triangle read by rows: R(n,k) = n mod 2^Omega(k), where Omega( ) is number of prime divisors counted with multiplicity and 1 <= k <= n.

Table of values

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

List of values

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