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.

A339389 a(n) is the number of ordered pairs (i, j) of numbers in the range 1..n-1 such that a(i) + a(j) >= a(n-1).

Table of values

n a(n)
1 0
2 1
3 3
4 5
5 8
6 12
7 14
8 21
9 21
10 38
11 23
12 68
13 24
14 114
15 28
16 149
17 36
18 182
19 47
20 209
21 60
22 247
23 68
24 315
25 70
26 397
27 68
28 515
29 71
30 605
31 82
32 667
33 106
34 690
35 147
36 700
37 206
38 717
39 255
40 747
41 282
42 835
43 244
44 1103
45 160
46 1462
47 124
48 1751
49 131
50 1913
51 160
52 1990
53 213
54 1988
55 324
56 1771

List of values

[0, 1, 3, 5, 8, 12, 14, 21, 21, 38, 23, 68, 24, 114, 28, 149, 36, 182, 47, 209, 60, 247, 68, 315, 70, 397, 68, 515, 71, 605, 82, 667, 106, 690, 147, 700, 206, 717, 255, 747, 282, 835, 244, 1103, 160, 1462, 124, 1751, 131, 1913, 160, 1990, 213, 1988, 324, 1771]