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.

A323454 Minimal number of steps to reach n from 1 using "Choix de Bruxelles", version 2 (cf. A323460), or -1 if n cannot be reached.

Table of values

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

List of values

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