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.

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

Table of values

n a(n)
27 1
28 6
29 16
30 31
31 52
32 76
33 107
34 143
35 184
36 233
37 289
38 354
39 427
40 512
41 606
42 716
43 835
44 972
45 1122
46 1292
47 1476
48 1685
49 1909
50 2161
51 2432
52 2734
53 3057
54 3417
55 3799
56 4222
57 4673
58 5168
59 5693
60 6270
61 6879
62 7545
63 8249
64 9014
65 9821
66 10698
67 11619
68 12616
69 13665
70 14795
71 15981
72 17259

List of values

[1, 6, 16, 31, 52, 76, 107, 143, 184, 233, 289, 354, 427, 512, 606, 716, 835, 972, 1122, 1292, 1476, 1685, 1909, 2161, 2432, 2734, 3057, 3417, 3799, 4222, 4673, 5168, 5693, 6270, 6879, 7545, 8249, 9014, 9821, 10698, 11619, 12616, 13665, 14795, 15981, 17259]