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.

A361854 Number of strict integer partitions of n such that (length) * (maximum) = 2n.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 1, 2, 2, 0, 5, 0, 6, 3, 5, 0, 11, 6, 8, 7, 10, 0, 36, 0, 14, 16, 16, 29, 43, 0, 21, 36, 69, 0, 97, 0, 35, 138, 33, 0, 150, 61, 137, 134, 74, 0, 231, 134, 265, 229, 56, 0, 650, 0, 65, 749, 267, 247, 533, 0, 405, 565]

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

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