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.

A098965 Number of integer partitions of n into distinct parts > 1 with a part dividing all the other parts.

Table of values

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

List of values

[0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 5, 1, 3, 3, 5, 1, 7, 1, 8, 4, 6, 1, 15, 2, 9, 5, 14, 1, 22, 1, 20, 7, 18, 4, 36, 1, 26, 10, 40, 1, 51, 1, 48, 18, 49, 1, 86, 3, 73, 19, 86, 1, 117, 7, 120, 27, 120, 1, 196, 1, 160, 42, 201, 10, 259, 1, 258, 50, 292, 1, 407, 1, 357, 81, 431, 8, 548, 1, 577]