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.

A282379 Number of representations of n as a sum of products of pairs of positive integers: n = Sum_{k=1..m} i_k*j_k with m >= 0, i_k <= j_k, j_k > j_{k+1} and all factors distinct with the exception that i_k = j_k is allowed.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 2
7 3
8 3
9 4
10 5
11 6
12 5
13 9
14 9
15 8
16 11
17 15
18 13
19 17
20 17
21 19
22 24
23 29
24 23
25 33
26 37
27 39
28 40
29 53
30 48
31 62
32 63
33 71
34 77
35 94
36 81
37 110
38 116
39 122
40 123
41 156
42 152
43 185
44 180
45 200
46 213
47 259
48 236
49 287
50 298
51 325
52 333
53 404
54 386
55 450
56 457
57 506
58 531
59 615
60 579
61 679
62 721

List of values

[1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 5, 6, 5, 9, 9, 8, 11, 15, 13, 17, 17, 19, 24, 29, 23, 33, 37, 39, 40, 53, 48, 62, 63, 71, 77, 94, 81, 110, 116, 122, 123, 156, 152, 185, 180, 200, 213, 259, 236, 287, 298, 325, 333, 404, 386, 450, 457, 506, 531, 615, 579, 679, 721]