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.

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

Table of values

n a(n)
35 1
36 7
37 22
38 48
39 88
40 140
41 207
42 291
43 389
44 508
45 646
46 809
47 995
48 1212
49 1457
50 1742
51 2061
52 2425
53 2833
54 3295
55 3808
56 4386
57 5024
58 5737
59 6522
60 7394
61 8349
62 9406
63 10559
64 11827
65 13208
66 14721
67 16361
68 18153
69 20090
70 22198
71 24472
72 26938
73 29591
74 32462
75 35543
76 38866
77 42427
78 46258

List of values

[1, 7, 22, 48, 88, 140, 207, 291, 389, 508, 646, 809, 995, 1212, 1457, 1742, 2061, 2425, 2833, 3295, 3808, 4386, 5024, 5737, 6522, 7394, 8349, 9406, 10559, 11827, 13208, 14721, 16361, 18153, 20090, 22198, 24472, 26938, 29591, 32462, 35543, 38866, 42427, 46258]