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.

A266114 Least siblings in A263267-tree: numbers n for which there doesn't exist any k < n such that k - d(k) = n - d(n), where d(n) = A000005(n), the number of divisors of n.

Table of values

n a(n)
1 1
2 3
3 5
4 6
5 7
6 8
7 9
8 11
9 13
10 14
11 17
12 18
13 19
14 20
15 22
16 23
17 24
18 25
19 27
20 29
21 31
22 32
23 34
24 35
25 37
26 38
27 40
28 41
29 43
30 44
31 46
32 47
33 49
34 50
35 51
36 53
37 56
38 57
39 58
40 59
41 61
42 62
43 65
44 67
45 68
46 71
47 72
48 73
49 74
50 77
51 79
52 81
53 82
54 83
55 84
56 86
57 87
58 88
59 89
60 92
61 93
62 94
63 95
64 96
65 97
66 98
67 99
68 101
69 102
70 103
71 104
72 105
73 106
74 107
75 109
76 113
77 114
78 116
79 118
80 119
81 120
82 121
83 123
84 125
85 127
86 128

List of values

[1, 3, 5, 6, 7, 8, 9, 11, 13, 14, 17, 18, 19, 20, 22, 23, 24, 25, 27, 29, 31, 32, 34, 35, 37, 38, 40, 41, 43, 44, 46, 47, 49, 50, 51, 53, 56, 57, 58, 59, 61, 62, 65, 67, 68, 71, 72, 73, 74, 77, 79, 81, 82, 83, 84, 86, 87, 88, 89, 92, 93, 94, 95, 96, 97, 98, 99, 101, 102, 103, 104, 105, 106, 107, 109, 113, 114, 116, 118, 119, 120, 121, 123, 125, 127, 128]