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.

A024936 a(n) = maximal length of partitions of n into distinct primes or -1 if there is no such partition.

Table of values

n a(n)
0 0
1 -1
2 1
3 1
4 -1
5 2
6 -1
7 2
8 2
9 2
10 3
11 1
12 3
13 2
14 3
15 3
16 3
17 4
18 3
19 3
20 3
21 4
22 3
23 4
24 3
25 4
26 4
27 4
28 5
29 4
30 5
31 4
32 4
33 4
34 5
35 4
36 5
37 4
38 5
39 5
40 5
41 6
42 5
43 5
44 5
45 6
46 5
47 6
48 5
49 6
50 5
51 6
52 5
53 6
54 5
55 6
56 6
57 6
58 7
59 6
60 7
61 6
62 6
63 6
64 7
65 6
66 7
67 6
68 7
69 6
70 7
71 6
72 7
73 6
74 7
75 7
76 7
77 8
78 7
79 7
80 7
81 8
82 7
83 8
84 7
85 7
86 7
87 8
88 7
89 8
90 7
91 8
92 7
93 8
94 7
95 8
96 7
97 8
98 8
99 8
100 9
101 8
102 7
103 8
104 8
105 8
106 9
107 8
108 9
109 8
110 9
111 8

List of values

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

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

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