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.

A379483 a(n) is the number of trailing 1-bits in the binary representation of sigma(A003961(n^2)), where A003961 is fully multiplicative with a(prime(i)) = prime(i+1), and sigma is the sum of divisors function.

Table of values

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

List of values

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