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.

A366370 Square array A(n,k) giving the length of the least significant run of 0-bits in binary expansion of A000225(n)^k, or 0 if A000225(n)^k is a binary repunit.

Table of values

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

List of values

[0, 0, 0, 0, 2, 0, 0, 1, 3, 0, 0, 3, 1, 4, 0, 0, 2, 4, 1, 5, 0, 0, 2, 2, 5, 1, 6, 0, 0, 1, 3, 2, 6, 1, 7, 0, 0, 4, 1, 4, 2, 7, 1, 8, 0, 0, 3, 5, 1, 5, 2, 8, 1, 9, 0, 0, 2, 3, 6, 1, 6, 2, 9, 1, 10, 0, 0, 1, 3, 3, 7, 1, 7, 2, 10, 1, 11, 0, 0, 3, 1, 4, 3, 8, 1, 8, 2, 11, 1, 12, 0, 0, 2, 4, 1, 5, 3, 9, 1, 9, 2, 12, 1, 13, 0]