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.

A304036 Number of partitions of n into at most 2 copies of 1!, 3 copies of 2!, 4 copies of 3!, ... .

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 2
5 1
6 3
7 2
8 3
9 1
10 2
11 1
12 3
13 2
14 3
15 1
16 2
17 1
18 3
19 2
20 3
21 1
22 2
23 1
24 4
25 3
26 5
27 2
28 4
29 2
30 5
31 3
32 4
33 1
34 2
35 1
36 3
37 2
38 3
39 1
40 2
41 1
42 3
43 2
44 3
45 1
46 2
47 1
48 4
49 3
50 5
51 2
52 4
53 2
54 5
55 3
56 4
57 1
58 2
59 1
60 3
61 2
62 3
63 1
64 2
65 1
66 3
67 2
68 3
69 1
70 2
71 1
72 4
73 3
74 5
75 2
76 4
77 2
78 5
79 3
80 4
81 1
82 2
83 1
84 3
85 2
86 3
87 1
88 2

List of values

[1, 1, 2, 1, 2, 1, 3, 2, 3, 1, 2, 1, 3, 2, 3, 1, 2, 1, 3, 2, 3, 1, 2, 1, 4, 3, 5, 2, 4, 2, 5, 3, 4, 1, 2, 1, 3, 2, 3, 1, 2, 1, 3, 2, 3, 1, 2, 1, 4, 3, 5, 2, 4, 2, 5, 3, 4, 1, 2, 1, 3, 2, 3, 1, 2, 1, 3, 2, 3, 1, 2, 1, 4, 3, 5, 2, 4, 2, 5, 3, 4, 1, 2, 1, 3, 2, 3, 1, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.