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.

A244240 Number of partitions of n into 4 parts such that every i-th smallest part (counted with multiplicity) is different from i.

Table of values

n a(n)
14 1
15 4
16 7
17 11
18 15
19 19
20 25
21 30
22 37
23 44
24 53
25 61
26 72
27 82
28 95
29 107
30 122
31 136
32 154
33 170
34 190
35 209
36 232
37 253
38 279
39 303
40 332
41 359
42 391
43 421
44 457
45 490
46 529
47 566
48 609
49 649
50 696
51 740
52 791
53 839
54 894
55 946
56 1006
57 1062
58 1126
59 1187
60 1256
61 1321
62 1395
63 1465
64 1544
65 1619
66 1703

List of values

[1, 4, 7, 11, 15, 19, 25, 30, 37, 44, 53, 61, 72, 82, 95, 107, 122, 136, 154, 170, 190, 209, 232, 253, 279, 303, 332, 359, 391, 421, 457, 490, 529, 566, 609, 649, 696, 740, 791, 839, 894, 946, 1006, 1062, 1126, 1187, 1256, 1321, 1395, 1465, 1544, 1619, 1703]