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.

A084702 a(n) is the smallest k such that k + 1 and n*k + 1 both are perfect squares, or 0 if no such number exists.

Table of values

n a(n)
1 3
2 24
3 8
4 0
5 3
6 8
7 24
8 3
9 0
10 8
11 48
12 24
13 15
14 120
15 8
16 3
17 15
18 168
19 80
20 48
21 3
22 24
23 360
24 15
25 0
26 24
27 440
28 8
29 120
30 80
31 120
32 195
33 3
34 840
35 24
36 8
37 35
38 960
39 440
40 3
41 168
42 120
43 168
44 28560
45 8
46 48
47 1680
48 35
49 0
50 48
51 24
52 120
53 483
54 175560
55 8
56 3
57 24
58 528
59 212520
60 728
61 63
62 3024

List of values

[3, 24, 8, 0, 3, 8, 24, 3, 0, 8, 48, 24, 15, 120, 8, 3, 15, 168, 80, 48, 3, 24, 360, 15, 0, 24, 440, 8, 120, 80, 120, 195, 3, 840, 24, 8, 35, 960, 440, 3, 168, 120, 168, 28560, 8, 48, 1680, 35, 0, 48, 24, 120, 483, 175560, 8, 3, 24, 528, 212520, 728, 63, 3024]