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.

A236846 Least inverse of A234742: a(n) = minimal k such that when it is remultiplied "upwards", from GF(2)[X] to N, the result is n, and 0 if no such k exists.

Table of values

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

List of values

[0, 1, 2, 3, 4, 0, 6, 7, 8, 5, 0, 11, 12, 13, 14, 0, 16, 0, 10, 19, 0, 9, 22, 0, 24, 25, 26, 15, 28, 0, 0, 31, 32, 29, 0, 0, 20, 37, 38, 23, 0, 41, 18, 0, 44, 0, 0, 47, 48, 21, 50, 0, 52, 0, 30, 55, 56, 53, 0, 59, 0, 61, 62, 27, 64, 0, 58, 67, 0, 0, 0, 0, 40, 73, 74, 43, 76, 49, 46, 0, 0, 17, 82, 0, 36, 0, 0, 87, 88, 0, 0, 35]