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.

A161135 Triangular array T(m,n), 1<=n<=m, giving the minimum positive number of deals of m cards into n piles required to collect all cards in the first pile. Each deal tosses all cards from a pile, the last dealt card indicates a pile to deal next, each deal tosses one card consecutively to the first, 2nd, ..., n-th, first, 2nd, ... pile.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 4
6 5
7 1
8 3
9 8
10 9
11 1
12 6
13 24
14 36
15 37
16 1
17 10
18 9
19 47
20 85
21 86
22 1
23 12
24 55
25 125
26 144
27 231
28 232
29 1
30 4
31 45
32 181
33 384
34 511
35 747
36 748
37 1
38 8
39 22
40 214
41 613
42 1097
43 183
44 931
45 932
46 1
47 18
48 28
49 54
50 373
51 837
52 993
53 1931
54 2864
55 2865
56 1
57 6
58 141
59 591
60 1642
61 3211
62 8451
63 1836
64 14891

List of values

[1, 1, 2, 1, 4, 5, 1, 3, 8, 9, 1, 6, 24, 36, 37, 1, 10, 9, 47, 85, 86, 1, 12, 55, 125, 144, 231, 232, 1, 4, 45, 181, 384, 511, 747, 748, 1, 8, 22, 214, 613, 1097, 183, 931, 932, 1, 18, 28, 54, 373, 837, 993, 1931, 2864, 2865, 1, 6, 141, 591, 1642, 3211, 8451, 1836, 14891]

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

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