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.

A239971 Least k>1 such that triangular(n) + triangular(n+k) is a square.

Table of values

n a(n)
0 8
1 4
2 10
3 16
4 22
5 6
6 34
7 40
8 14
9 52
10 58
11 8
12 16
13 76
14 82
15 24
16 94
17 100
18 106
19 10
20 23
21 124
22 20
23 136
24 142
25 25
26 36
27 160
28 22
29 12
30 178
31 184
32 55
33 46
34 202
35 208
36 54
37 220
38 226
39 34
40 56
41 14
42 26
43 31
44 262
45 36
46 274
47 66
48 49
49 89
50 28
51 304
52 65
53 316
54 76
55 16
56 48
57 84
58 346
59 352
60 358
61 86
62 50
63 376

List of values

[8, 4, 10, 16, 22, 6, 34, 40, 14, 52, 58, 8, 16, 76, 82, 24, 94, 100, 106, 10, 23, 124, 20, 136, 142, 25, 36, 160, 22, 12, 178, 184, 55, 46, 202, 208, 54, 220, 226, 34, 56, 14, 26, 31, 262, 36, 274, 66, 49, 89, 28, 304, 65, 316, 76, 16, 48, 84, 346, 352, 358, 86, 50, 376]

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

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