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.

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

Table of values

n a(n)
20 1
21 5
22 11
23 19
24 29
25 39
26 53
27 67
28 84
29 103
30 126
31 150
32 179
33 210
34 246
35 285
36 329
37 376
38 430
39 487
40 551
41 619
42 695
43 775
44 864
45 958
46 1061
47 1170
48 1289
49 1414
50 1551
51 1694
52 1849
53 2012
54 2188
55 2372
56 2570
57 2777
58 2999
59 3231
60 3479
61 3737
62 4013
63 4300
64 4605
65 4923
66 5260
67 5610
68 5981

List of values

[1, 5, 11, 19, 29, 39, 53, 67, 84, 103, 126, 150, 179, 210, 246, 285, 329, 376, 430, 487, 551, 619, 695, 775, 864, 958, 1061, 1170, 1289, 1414, 1551, 1694, 1849, 2012, 2188, 2372, 2570, 2777, 2999, 3231, 3479, 3737, 4013, 4300, 4605, 4923, 5260, 5610, 5981]