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.

A111701 Least integer obtained when n is divided by prime(1), then by prime(2), then by prime(3), ..., stopping as soon as one of the primes does not divide it. In particular, a(2n-1) = 2n-1.

Table of values

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

List of values

[1, 1, 3, 2, 5, 1, 7, 4, 9, 5, 11, 2, 13, 7, 15, 8, 17, 3, 19, 10, 21, 11, 23, 4, 25, 13, 27, 14, 29, 1, 31, 16, 33, 17, 35, 6, 37, 19, 39, 20, 41, 7, 43, 22, 45, 23, 47, 8, 49, 25, 51, 26, 53, 9, 55, 28, 57, 29, 59, 2, 61, 31, 63, 32, 65, 11, 67, 34, 69, 35, 71, 12, 73, 37, 75, 38, 77]