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.

A368470 a(n) is the number of exponentially odd divisors of the largest unitary divisor of n that is an exponentially odd number (A268335).

Table of values

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

List of values

[1, 2, 2, 1, 2, 4, 2, 3, 1, 4, 2, 2, 2, 4, 4, 1, 2, 2, 2, 2, 4, 4, 2, 6, 1, 4, 3, 2, 2, 8, 2, 4, 4, 4, 4, 1, 2, 4, 4, 6, 2, 8, 2, 2, 2, 4, 2, 2, 1, 2, 4, 2, 2, 6, 4, 6, 4, 4, 2, 4, 2, 4, 2, 1, 4, 8, 2, 2, 4, 8, 2, 3, 2, 4, 2, 2, 4, 8, 2, 2, 1, 4, 2, 4, 4, 4, 4]