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.

A280943 Least number k such that sopfr(k) = sopfr(k + n), where sopfr(k) is the integer log of k.

Table of values

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

List of values

[5, 10, 7, 20, 7, 14, 20, 40, 13, 14, 21, 28, 14, 40, 19, 33, 11, 26, 56, 28, 49, 42, 115, 56, 35, 28, 31, 57, 11, 38, 50, 66, 63, 11, 17, 52, 11, 112, 42, 51, 22, 98, 11, 84, 57, 35, 52, 95, 138, 13, 33, 56, 22, 62, 77, 114, 61, 22, 39, 76, 44, 13, 91, 57, 70]

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

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