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.

A099120 Least m such that n = S(k) = S(k+m) for some k, where S is the Kempner function A002034.

Table of values

n a(n)
3 3
4 4
5 5
6 2
7 7
8 32
9 27
10 8
11 11
12 26
13 13
14 48
15 19
16 4096
17 17
18 74
19 19
20 447
21 27
22 121
23 23
24 4005
25 3125
26 169
27 177147
28 2401
29 29
30 1203
31 31
32 134217728
33 459
34 289
35 551
36 2684163
37 37

List of values

[3, 4, 5, 2, 7, 32, 27, 8, 11, 26, 13, 48, 19, 4096, 17, 74, 19, 447, 27, 121, 23, 4005, 3125, 169, 177147, 2401, 29, 1203, 31, 134217728, 459, 289, 551, 2684163, 37]