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.

A292727 a(n) is the number of states that cannot be achieved when starting from n piles each containing one stone, where stones can be transferred between piles only when they start with the same number of stones.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 3
7 1
8 0
9 3
10 4
11 1
12 7
13 1
14 5
15 9
16 0
17 1
18 14
19 1
20 9
21 17
22 7
23 1
24 26
25 7
26 8
27 30
28 11
29 1
30 55
31 1
32 0
33 58
34 10
35 21
36 83
37 1
38 11
39 103
40 30
41 1
42 150
43 1
44 15
45 203
46 13
47 1
48 239
49 15
50 52
51 299
52 17
53 1
54 394
55 62
56 34
57 492
58 16
59 1
60 707
61 1
62 17
63 819
64 0
65 107
66 1021
67 1
68 21
69 1257
70 187
71 1
72 1587

List of values

[0, 0, 1, 0, 1, 3, 1, 0, 3, 4, 1, 7, 1, 5, 9, 0, 1, 14, 1, 9, 17, 7, 1, 26, 7, 8, 30, 11, 1, 55, 1, 0, 58, 10, 21, 83, 1, 11, 103, 30, 1, 150, 1, 15, 203, 13, 1, 239, 15, 52, 299, 17, 1, 394, 62, 34, 492, 16, 1, 707, 1, 17, 819, 0, 107, 1021, 1, 21, 1257, 187, 1, 1587]