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.

A145574 Array a(n,m) for number of partitions of n>=2 with m parts having no part 1. Hence m=1..floor(n/2).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 1, 1, 3, 3, 1, 1, 4, 4, 2, 1, 1, 4, 5, 3, 1, 1, 5, 7, 5, 2, 1, 1, 5, 8, 6, 3, 1, 1, 6, 10, 9, 5, 2, 1, 1, 6, 12, 11, 7, 3, 1, 1, 7, 14, 15, 10, 5, 2, 1, 1, 7, 16, 18, 13, 7, 3, 1, 1, 8, 19, 23, 18, 11, 5, 2, 1, 1, 8, 21, 27, 23, 14, 7, 3, 1, 1, 9, 24, 34, 30]