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.

A319057 Minimum sum of a strict factorization of n into factors > 1.

Table of values

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

List of values

[0, 2, 3, 4, 5, 5, 7, 6, 9, 7, 11, 7, 13, 9, 8, 10, 17, 9, 19, 9, 10, 13, 23, 9, 25, 15, 12, 11, 29, 10, 31, 12, 14, 19, 12, 11, 37, 21, 16, 11, 41, 12, 43, 15, 14, 25, 47, 12, 49, 15, 20, 17, 53, 14, 16, 13, 22, 31, 59, 12, 61, 33, 16, 14, 18, 16, 67, 21, 26]

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

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