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.

A275288 Least k such that there exists a sequence b_1 < b_2 < ... < b_t = k that includes n and has a reciprocal sum of 1.

Table of values

n a(n)
1 1
2 6
3 6
4 12
5 20
6 6
7 28
8 24
9 18
10 15
11 33
12 12
13 65
14 28
15 15
16 48
17 85
18 18
19 76
20 20
21 28
22 33
23 115
24 24
25 100
26 52
27 54
28 28
29 145
30 30
31 217
32 96
33 33
34 85
35 35
36 36
37 296
38 95
39 52
40 40
41 246
42 42
43 301
44 55
45 45
46 138
47 329
48 48
49 196
50 75
51 102
52 52
53 371
54 54
55 55
56 56
57 76
58 174
59 531
60 60
61 305
62 155

List of values

[1, 6, 6, 12, 20, 6, 28, 24, 18, 15, 33, 12, 65, 28, 15, 48, 85, 18, 76, 20, 28, 33, 115, 24, 100, 52, 54, 28, 145, 30, 217, 96, 33, 85, 35, 36, 296, 95, 52, 40, 246, 42, 301, 55, 45, 138, 329, 48, 196, 75, 102, 52, 371, 54, 55, 56, 76, 174, 531, 60, 305, 155]

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

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