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.

A335756 A cup filling problem starting with 2 empty cups of sizes 3 and n, where a(n) is the number of unreachable states (see details in comments).

Table of values

n a(n)
0 2
1 0
2 2
3 12
4 6
5 8
6 22
7 12
8 14
9 32
10 18
11 20
12 42
13 24
14 26
15 52
16 30
17 32
18 62
19 36
20 38
21 72
22 42
23 44
24 82
25 48
26 50
27 92
28 54
29 56
30 102
31 60
32 62
33 112
34 66
35 68
36 122
37 72
38 74
39 132
40 78
41 80
42 142
43 84
44 86
45 152
46 90
47 92
48 162
49 96
50 98
51 172
52 102
53 104
54 182
55 108
56 110
57 192
58 114
59 116
60 202
61 120
62 122
63 212
64 126
65 128
66 222

List of values

[2, 0, 2, 12, 6, 8, 22, 12, 14, 32, 18, 20, 42, 24, 26, 52, 30, 32, 62, 36, 38, 72, 42, 44, 82, 48, 50, 92, 54, 56, 102, 60, 62, 112, 66, 68, 122, 72, 74, 132, 78, 80, 142, 84, 86, 152, 90, 92, 162, 96, 98, 172, 102, 104, 182, 108, 110, 192, 114, 116, 202, 120, 122, 212, 126, 128, 222]