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.

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

Table of values

n a(n)
65 1
66 10
67 46
68 139
69 329
70 660
71 1173
72 1918
73 2938
74 4277
75 5990
76 8123
77 10742
78 13903
79 17678
80 22140
81 27383
82 33487
83 40560
84 48710
85 58055
86 68734
87 80881
88 94657
89 110223
90 127771
91 147478
92 169580
93 194278
94 221842
95 252503
96 286579
97 324327
98 366120
99 412247
100 463132
101 519112
102 580667

List of values

[1, 10, 46, 139, 329, 660, 1173, 1918, 2938, 4277, 5990, 8123, 10742, 13903, 17678, 22140, 27383, 33487, 40560, 48710, 58055, 68734, 80881, 94657, 110223, 127771, 147478, 169580, 194278, 221842, 252503, 286579, 324327, 366120, 412247, 463132, 519112, 580667]