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.

A079427 Least m > n having the same number of divisors as n, a(1) = 1.

Table of values

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

List of values

[1, 3, 5, 9, 7, 8, 11, 10, 25, 14, 13, 18, 17, 15, 21, 81, 19, 20, 23, 28, 22, 26, 29, 30, 49, 27, 33, 32, 31, 40, 37, 44, 34, 35, 38, 100, 41, 39, 46, 42, 43, 54, 47, 45, 50, 51, 53, 80, 121, 52, 55, 63, 59, 56, 57, 66, 58, 62, 61, 72, 67, 65, 68, 729, 69, 70, 71, 75, 74, 78, 73]

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

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