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.

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

Table of values

n a(n)
54 1
55 9
56 37
57 101
58 220
59 410
60 684
61 1062
62 1553
63 2174
64 2943
65 3875
66 4995
67 6319
68 7876
69 9689
70 11798
71 14219
72 17005
73 20179
74 23798
75 27894
76 32531
77 37743
78 43610
79 50169
80 57509
81 65679
82 74778
83 84858
84 96036
85 108373
86 121997
87 136983
88 153471
89 171546
90 191373
91 213040
92 236731
93 262556

List of values

[1, 9, 37, 101, 220, 410, 684, 1062, 1553, 2174, 2943, 3875, 4995, 6319, 7876, 9689, 11798, 14219, 17005, 20179, 23798, 27894, 32531, 37743, 43610, 50169, 57509, 65679, 74778, 84858, 96036, 108373, 121997, 136983, 153471, 171546, 191373, 213040, 236731, 262556]