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.

A366753 Number of integer partitions of n without all different sums of two-element submultisets.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 1
9 1
10 3
11 4
12 9
13 11
14 22
15 27
16 48
17 61
18 98
19 123
20 188
21 237
22 345
23 435
24 611
25 765
26 1046
27 1305
28 1741
29 2165
30 2840
31 3502
32 4527
33 5562
34 7083
35 8650
36 10908
37 13255
38 16545
39 20016
40 24763
41 29834
42 36587
43 43911
44 53514
45 63964
46 77445
47 92239
48 111015
49 131753

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 4, 9, 11, 22, 27, 48, 61, 98, 123, 188, 237, 345, 435, 611, 765, 1046, 1305, 1741, 2165, 2840, 3502, 4527, 5562, 7083, 8650, 10908, 13255, 16545, 20016, 24763, 29834, 36587, 43911, 53514, 63964, 77445, 92239, 111015, 131753]