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.

A284114 Number of partitions of n such that Omega(n) (= number of prime divisors of n counted with multiplicity) equals the sum of Omega of all parts; Omega = A001222.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 5
7 4
8 7
9 9
10 12
11 5
12 22
13 6
14 17
15 19
16 55
17 7
18 50
19 8
20 60
21 28
22 32
23 9
24 166
25 37
26 41
27 113
28 122
29 10
30 137
31 11
32 631
33 51
34 56
35 57
36 475
37 12
38 64
39 66
40 620
41 13
42 258
43 14
44 282
45 301
46 83
47 15
48 2229
49 90
50 359
51 95
52 394
53 16
54 1302
55 105
56 1435
57 109
58 114
59 17
60 1708
61 18
62 125

List of values

[1, 1, 1, 2, 2, 3, 5, 4, 7, 9, 12, 5, 22, 6, 17, 19, 55, 7, 50, 8, 60, 28, 32, 9, 166, 37, 41, 113, 122, 10, 137, 11, 631, 51, 56, 57, 475, 12, 64, 66, 620, 13, 258, 14, 282, 301, 83, 15, 2229, 90, 359, 95, 394, 16, 1302, 105, 1435, 109, 114, 17, 1708, 18, 125]