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.

A385584 a(n) is the number of pairs (p, t) such that p is a pyramidal number, t is a triangular number, p + t <= n and t <= p.

Table of values

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

List of values

[1, 2, 3, 3, 4, 5, 5, 6, 6, 6, 7, 8, 8, 9, 9, 9, 10, 10, 10, 10, 12, 13, 13, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 18, 19, 19, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 25, 26, 26, 27, 27, 27, 28, 29, 29, 29, 30, 30, 30, 30, 30, 31, 31, 31]