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.

A108352 a(n) = primal code characteristic of n, which is the least positive integer, if any, such that (n o)^k = 1, otherwise equal to 0. Here "o" denotes the primal composition operator, as illustrated in A106177 and A108371 and (n o)^k = n o ... o n, with k occurrences of n.

Table of values

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

List of values

[1, 0, 2, 2, 2, 0, 2, 2, 0, 0, 2, 0, 2, 0, 2, 2, 2, 0, 2, 3, 2, 0, 2, 3, 2, 0, 2, 3, 2, 0, 2, 2, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 3, 0, 0, 2, 3, 2, 0, 2, 3, 2, 0, 2, 3, 2, 0, 2, 0, 2, 0, 0, 2, 2, 0, 2, 3, 2, 0, 2, 0, 2, 0, 3, 3, 2, 0, 2, 3, 2, 0, 2, 0, 2, 0, 2, 3, 2, 0, 2, 3, 2, 0, 2, 3, 2, 0, 0, 2, 2, 0, 2, 3, 2]