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.

A138768 For a positive integer n, write the integers 1,2,...,n in the following order: first write 1 (round 0), then all primes less than or equal to n in increasing order (round 1), then 2p for all primes p with 2p<=n, also in increasing order (round 2), then 3p, then 4p and so on. Each number is written down only the first time it is encountered. Let a(n) denote the last number written down.

Table of values

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

List of values

[1, 2, 3, 4, 4, 6, 6, 8, 8, 8, 8, 12, 12, 12, 12, 16, 16, 16, 16, 16, 16, 16, 16, 24, 24, 24, 27, 27, 27, 27, 27, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 48, 48, 48, 48, 48, 48, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64]