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.

A227452 Irregular table where each row lists the partitions occurring on the main trunk of the Bulgarian Solitaire game tree (from the top to the root) for deck of n(n+1)/2 cards. Nonordered partitions are encoded in the runlengths of binary expansion of each term, in the manner explained in A129594.

Table of values

n a(n)
0 0
1 1
2 5
3 7
4 6
5 18
6 61
7 8
8 11
9 58
10 28
11 25
12 77
13 246
14 66
15 55
16 36
17 237
18 226
19 35
20 46
21 116
22 197
23 115
24 102
25 306
26 985
27 265
28 445
29 200
30 155
31 946
32 905
33 285
34 220
35 145
36 475
37 786
38 925
39 140
40 185
41 465
42 395
43 826
44 460
45 409
46 1229
47 3942
48 1062
49 1782
50 1602
51 823
52 612
53 3789
54 3622
55 1142

List of values

[0, 1, 5, 7, 6, 18, 61, 8, 11, 58, 28, 25, 77, 246, 66, 55, 36, 237, 226, 35, 46, 116, 197, 115, 102, 306, 985, 265, 445, 200, 155, 946, 905, 285, 220, 145, 475, 786, 925, 140, 185, 465, 395, 826, 460, 409, 1229, 3942, 1062, 1782, 1602, 823, 612, 3789, 3622, 1142]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.