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.

A061798 Number of sums i^3 + j^3 that occur more than once for 1<=i<=j<=n.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 7, 7, 8, 8, 8, 9, 10, 10, 10, 10, 10, 10, 10, 10, 12, 12, 12, 13, 13, 14, 15, 16, 16, 16, 17, 17, 19, 19, 19, 19, 20, 20, 20, 21, 23, 24, 24, 24, 25, 25, 25, 25]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.