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.

A225594 Least splitter of s(n) and s(n+1), where s(n) = (1 + n)^(1/n).

Table of values

n a(n)
1 1
2 3
3 5
4 9
5 2
6 11
7 9
8 7
9 12
10 5
11 18
12 13
13 8
14 19
15 11
16 25
17 14
18 17
19 23
20 26
21 35
22 44
23 65
24 116
25 3
26 115
27 73
28 55
29 46
30 37
31 34
32 31
33 28
34 25
35 47
36 22
37 41
38 19
39 73
40 35
41 51
42 83
43 16
44 61
45 45
46 29
47 42
48 55
49 68
50 107
51 13
52 101
53 75
54 49
55 85
56 36
57 59
58 105
59 23
60 79
61 56
62 33
63 109
64 76
65 43
66 53

List of values

[1, 3, 5, 9, 2, 11, 9, 7, 12, 5, 18, 13, 8, 19, 11, 25, 14, 17, 23, 26, 35, 44, 65, 116, 3, 115, 73, 55, 46, 37, 34, 31, 28, 25, 47, 22, 41, 19, 73, 35, 51, 83, 16, 61, 45, 29, 42, 55, 68, 107, 13, 101, 75, 49, 85, 36, 59, 105, 23, 79, 56, 33, 109, 76, 43, 53]

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

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