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.

A318271 The optimum crossing time for the Bridge and Torch problem, given that the crossing times for the group's members are given by the n-th partition in A026791.

Table of values

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

List of values

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