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.

A102829 "True already", base 3, start 1: a(n) is the least integer such that the sequence up to a(n-1) written in base 3 contains floor(a(n)/3) copies of the digit a(n) % 3, with a(0) = 1.

Table of values

n a(n)
0 1
1 2
2 4
3 5
4 8
5 13
6 14
7 17
8 23
9 29
10 32
11 35
12 41
13 44
14 50
15 56
16 62
17 67
18 74
19 76
20 82
21 88
22 92
23 95
24 98
25 104
26 110
27 113
28 116
29 122
30 125
31 131
32 137
33 143
34 152
35 161
36 173
37 179
38 188
39 193
40 202
41 206
42 215
43 223
44 226
45 232
46 238
47 244
48 250
49 256
50 263
51 269
52 274
53 278
54 284
55 287
56 293
57 299

List of values

[1, 2, 4, 5, 8, 13, 14, 17, 23, 29, 32, 35, 41, 44, 50, 56, 62, 67, 74, 76, 82, 88, 92, 95, 98, 104, 110, 113, 116, 122, 125, 131, 137, 143, 152, 161, 173, 179, 188, 193, 202, 206, 215, 223, 226, 232, 238, 244, 250, 256, 263, 269, 274, 278, 284, 287, 293, 299]