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.

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

Table of values

n a(n)
44 1
45 8
46 29
47 71
48 142
49 245
50 384
51 567
52 792
53 1069
54 1401
55 1796
56 2260
57 2801
58 3427
59 4150
60 4981
61 5925
62 7004
63 8222
64 9602
65 11151
66 12895
67 14838
68 17016
69 19430
70 22120
71 25090
72 28385
73 32004
74 36004
75 40384
76 45203
77 50463
78 56231
79 62506
80 69367
81 76809
82 84919
83 93697
84 103237
85 113534

List of values

[1, 8, 29, 71, 142, 245, 384, 567, 792, 1069, 1401, 1796, 2260, 2801, 3427, 4150, 4981, 5925, 7004, 8222, 9602, 11151, 12895, 14838, 17016, 19430, 22120, 25090, 28385, 32004, 36004, 40384, 45203, 50463, 56231, 62506, 69367, 76809, 84919, 93697, 103237, 113534]