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.

A384502 Maximum number of distinct prime factors in an n-digit number, n > 3, where its set of distinct prime factors can be partitioned into two equal-sum subsets, each containing at least two elements.

Table of values

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

List of values

[5, 5, 7, 7, 7, 9, 9, 9, 11, 11, 11, 13, 13, 13, 15, 15, 15, 16, 17, 17, 17, 19, 19, 19, 19, 21, 21, 21, 21, 23, 23, 23, 23, 25, 25, 25, 25, 27, 27, 27, 27, 29, 29, 29, 29, 31, 31, 31, 31, 33, 33, 33, 33, 34, 35, 35, 35, 35, 37, 37, 37, 37, 39, 39, 39, 39, 39, 41]

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

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