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.

A176615 Number of edges in the graph on n vertices, labeled 1 to n, where two vertices are joined just if their labels sum to a perfect square.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 2
6 3
7 4
8 5
9 6
10 7
11 8
12 9
13 11
14 13
15 15
16 16
17 17
18 18
19 20
20 22
21 24
22 26
23 28
24 30
25 32
26 34
27 36
28 38
29 40
30 42
31 44
32 46
33 49
34 52
35 55
36 57
37 59
38 61
39 63
40 65
41 68
42 71
43 74
44 77
45 80
46 83
47 86
48 89
49 91
50 93
51 96
52 99
53 102
54 105
55 108
56 111
57 114
58 117
59 120
60 123
61 127
62 131
63 135
64 138
65 141
66 144
67 147
68 150

List of values

[0, 0, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 16, 17, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 49, 52, 55, 57, 59, 61, 63, 65, 68, 71, 74, 77, 80, 83, 86, 89, 91, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 127, 131, 135, 138, 141, 144, 147, 150]