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.

A185166 Number of prime divisors of n (counted with multiplicity) of numbers k such that sum of proper divisors of k exceeds that of all smaller numbers.

Table of values

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

List of values

[0, 1, 2, 2, 3, 2, 3, 3, 3, 4, 3, 4, 5, 4, 5, 4, 4, 6, 5, 5, 6, 5, 5, 6, 6, 7, 5, 6, 6, 5, 7, 6, 6, 6, 5, 7, 6, 8, 7, 7, 7, 6, 8, 6, 7, 6, 6, 8, 6, 8, 7, 9, 7, 8, 8, 8, 7, 7, 7, 9, 6, 7, 8, 7, 7, 7, 9, 9, 8, 8, 7, 9, 7, 8, 8, 8, 7, 9, 7, 9, 8, 8, 10, 8, 9, 9, 9]

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

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