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.

A072808 Smallest m such that sigma(m) mod phi(m) = n or 0 if no solution exists.

Table of values

n a(n)
1 4
2 5
3 8
4 24
5 0
6 22
7 16
8 21
9 450
10 40
11 25
12 48
13 50
14 136
15 32
16 110
17 100
18 90
19 144
20 88
21 0
22 656
23 121
24 102
25 0
26 80
27 169
28 96
29 0
30 68
31 64
32 55
33 676
34 464
35 289
36 65
37 0
38 117
39 162
40 91
41 0
42 116
43 225
44 85
45 0
46 272
47 529
48 95
49 0
50 148
51 288
52 133
53 0
54 164
55 0
56 115
57 0
58 160
59 841
60 147
61 0
62 333
63 128
64 247

List of values

[4, 5, 8, 24, 0, 22, 16, 21, 450, 40, 25, 48, 50, 136, 32, 110, 100, 90, 144, 88, 0, 656, 121, 102, 0, 80, 169, 96, 0, 68, 64, 55, 676, 464, 289, 65, 0, 117, 162, 91, 0, 116, 225, 85, 0, 272, 529, 95, 0, 148, 288, 133, 0, 164, 0, 115, 0, 160, 841, 147, 0, 333, 128, 247]

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

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