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.

A328744 Dirichlet g.f.: Product_{k>=2} (1 + k^(-s))^q(k), where q(k) = number of partitions of k into distinct parts (A000009).

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 3
6 6
7 5
8 8
9 9
10 13
11 12
12 23
13 18
14 27
15 33
16 39
17 38
18 63
19 54
20 80
21 86
22 101
23 104
24 161
25 145
26 183
27 208
28 254
29 256
30 361
31 340
32 435
33 472
34 550
35 600
36 776
37 760
38 918
39 1018
40 1221
41 1260
42 1576
43 1610
44 1929
45 2129
46 2408
47 2590
48 3172
49 3274
50 3833
51 4173
52 4783
53 5120
54 6054
55 6414
56 7414
57 8025

List of values

[1, 1, 2, 2, 3, 6, 5, 8, 9, 13, 12, 23, 18, 27, 33, 39, 38, 63, 54, 80, 86, 101, 104, 161, 145, 183, 208, 254, 256, 361, 340, 435, 472, 550, 600, 776, 760, 918, 1018, 1221, 1260, 1576, 1610, 1929, 2129, 2408, 2590, 3172, 3274, 3833, 4173, 4783, 5120, 6054, 6414, 7414, 8025]