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.

A073820 a(n) = n+1-i such that prime(i)*(n+1-i) is maximized (1 <= i <= n).

Table of values

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

List of values

[1, 2, 3, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 5, 6, 7, 8, 9, 8, 9, 10, 10, 11, 12, 13, 10, 11, 12, 13, 14, 15, 16, 15, 16, 17, 17, 18, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 20, 21, 22, 23, 24, 25, 26, 27, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 32, 33, 31, 30, 31, 32, 33, 34]

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

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