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.

A201144 The pebble sequence: a(n) is the length of the longest non-repeating sequence of pebble-moves among the partitions of n.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 6
6 7
7 8
8 9
9 11
10 13
11 13
12 13
13 14
14 19
15 21
16 21
17 18
18 19
19 22
20 29
21 31
22 31
23 25
24 25
25 26
26 33
27 41
28 43
29 43
30 36
31 32
32 33
33 37
34 46
35 55
36 57
37 57
38 49
39 41
40 41
41 42
42 51
43 61
44 71
45 73
46 73
47 64
48 55
49 50
50 51
51 56
52 67
53 78
54 89
55 91
56 91
57 81
58 71
59 61
60 61
61 62
62 73
63 85
64 97
65 109
66 111
67 111
68 100
69 89
70 78
71 72
72 73
73 79
74 92
75 105
76 118
77 131
78 133
79 133
80 121
81 109
82 97
83 85
84 85
85 86
86 99
87 113
88 127
89 141
90 155
91 157
92 157
93 144
94 131
95 118
96 105
97 98
98 99
99 106
100 121

List of values

[1, 2, 3, 5, 6, 7, 8, 9, 11, 13, 13, 13, 14, 19, 21, 21, 18, 19, 22, 29, 31, 31, 25, 25, 26, 33, 41, 43, 43, 36, 32, 33, 37, 46, 55, 57, 57, 49, 41, 41, 42, 51, 61, 71, 73, 73, 64, 55, 50, 51, 56, 67, 78, 89, 91, 91, 81, 71, 61, 61, 62, 73, 85, 97, 109, 111, 111, 100, 89, 78, 72, 73, 79, 92, 105, 118, 131, 133, 133, 121, 109, 97, 85, 85, 86, 99, 113, 127, 141, 155, 157, 157, 144, 131, 118, 105, 98, 99, 106, 121]