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.

A067721 Least number k such that k (k + n) is a perfect square, or 0 if impossible.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 0
5 4
6 2
7 9
8 1
9 3
10 8
11 25
12 4
13 36
14 18
15 1
16 2
17 64
18 6
19 81
20 16
21 4
22 50
23 121
24 1
25 20
26 72
27 9
28 36
29 196
30 2
31 225
32 4
33 11
34 128
35 1
36 12
37 324
38 162
39 13
40 5
41 400
42 8
43 441
44 100
45 3
46 242
47 529
48 1
49 63
50 40
51 17
52 144
53 676
54 18
55 9
56 7
57 19
58 392
59 841
60 4
61 900
62 450
63 1
64 8
65 16
66 22
67 1089
68 256
69 23
70 2
71 1225

List of values

[1, 0, 0, 1, 0, 4, 2, 9, 1, 3, 8, 25, 4, 36, 18, 1, 2, 64, 6, 81, 16, 4, 50, 121, 1, 20, 72, 9, 36, 196, 2, 225, 4, 11, 128, 1, 12, 324, 162, 13, 5, 400, 8, 441, 100, 3, 242, 529, 1, 63, 40, 17, 144, 676, 18, 9, 7, 19, 392, 841, 4, 900, 450, 1, 8, 16, 22, 1089, 256, 23, 2, 1225]