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.

A303601 Number of ways to write n as a*(a+1)/2 + b*(b+1)/2 + Bell(k) + Bell(m) with 0 <= a <= b and 0 < k <= m, where Bell(k) denotes the k-th Bell number A000110(k).

Table of values

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

List of values

[0, 1, 2, 3, 3, 4, 4, 5, 5, 6, 4, 5, 7, 5, 4, 7, 7, 7, 8, 8, 5, 9, 10, 7, 6, 9, 8, 8, 6, 7, 10, 10, 9, 8, 7, 8, 9, 10, 6, 9, 11, 7, 6, 8, 9, 10, 7, 10, 8, 7, 8, 10, 10, 9, 10, 8, 9, 13, 14, 10, 11, 12, 12, 9, 9, 12, 11, 13, 11, 9]