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.

A361944 a(n) is the least k > 0 such that the binary expansion of k*n is an abelian square (A272653).

Table of values

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

List of values

[3, 5, 1, 9, 2, 6, 9, 17, 1, 1, 3, 3, 10, 11, 1, 33, 2, 2, 10, 26, 3, 6, 2, 22, 6, 5, 2, 21, 25, 5, 33, 65, 1, 1, 18, 1, 6, 5, 4, 13, 15, 14, 1, 3, 1, 1, 5, 11, 3, 3, 1, 3, 1, 1, 3, 41, 9, 37, 11, 10, 3, 39, 1, 129, 2, 2, 3, 2, 9, 9, 8, 11, 3, 3, 2, 27, 2, 2, 3]