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.

A098670 Start with a(1) = 5. Construct slowest growing sequence such that the statement "the a(n)-th digit is a 2" is true for all n.

Table of values

n a(n)
1 5
2 6
3 7
4 8
5 22
6 220
7 221
8 222
9 223
10 224
11 225
12 226
13 227
14 228
15 229
16 230
17 231
18 232
19 233
20 234
21 235
22 236
23 237
24 238
25 239
26 240
27 241
28 242
29 243
30 244
31 245
32 246
33 247
34 248
35 249
36 250
37 251
38 252
39 253
40 254
41 255
42 256
43 257
44 258
45 259
46 260
47 261
48 262
49 263
50 264
51 265
52 266
53 267
54 268
55 269
56 270

List of values

[5, 6, 7, 8, 22, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270]

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

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