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.

A377307 Minimum number of consecutive pieces that must be added to the pattern given by the binary representation of n to produce a winning position in Gordon Hamilton's Jumping Frogs game, or -1 if there is no such position.

Table of values

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

List of values

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