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.

A384632 a(0)=0. For each digit d in the sequence, let a(n) equal the smallest unused integer which has at least d divisors.

Table of values

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

List of values

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

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

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