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.

A292836 a(n) is the minimum number of steps to a terminal state during the following procedure: start with n piles each containing one stone; any number of stones can be transferred between piles of equal size.

Table of values

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

List of values

[0, 1, 1, 3, 3, 4, 4, 6, 7, 7, 8, 10, 10, 11, 11, 13, 14, 14, 15, 17, 17, 18, 18, 20, 21, 22, 23, 24, 24, 25, 26, 28, 29, 29, 30, 31, 32, 33, 33, 35, 36, 37, 38, 39, 39, 40, 41, 43, 44, 44, 45, 46, 47, 48, 48, 50, 51, 52, 53, 54, 54, 55, 56, 58, 59, 59, 60, 62, 62]