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.

A384665 Smallest odd multiplier k such that k*n is abundant.

Table of values

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

List of values

[945, 9, 315, 3, 189, 3, 135, 3, 105, 3, 315, 1, 315, 3, 63, 3, 315, 1, 315, 1, 45, 3, 315, 1, 63, 3, 35, 3, 315, 1, 315, 3, 105, 3, 27, 1, 315, 3, 105, 1, 315, 1, 315, 3, 21, 3, 315, 1, 45, 3, 105, 3, 315, 1, 63, 1, 105, 3, 315, 1, 315, 3, 15, 3, 63, 1, 315, 3]

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

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