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.

A326357 a(n) = number of partitions of n that occur more than once among the condensed partitions of n; see A239312.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 1
5 3
6 2
7 4
8 5
9 7
10 11
11 11
12 15
13 19
14 25
15 29
16 39
17 47
18 61
19 67
20 85
21 107
22 128
23 154
24 182
25 219
26 264
27 310
28 366
29 441
30 514
31 608
32 705
33 836
34 974
35 1128
36 1312
37 1530
38 1776
39 2053
40 2367
41 2735
42 3156
43 3598
44 4145
45 4745
46 5463
47 6204
48 7084
49 8068
50 9241
51 10455
52 11906
53 13488

List of values

[0, 0, 1, 1, 1, 3, 2, 4, 5, 7, 11, 11, 15, 19, 25, 29, 39, 47, 61, 67, 85, 107, 128, 154, 182, 219, 264, 310, 366, 441, 514, 608, 705, 836, 974, 1128, 1312, 1530, 1776, 2053, 2367, 2735, 3156, 3598, 4145, 4745, 5463, 6204, 7084, 8068, 9241, 10455, 11906, 13488]