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.

A352764 Smallest number of edges in an asymmetric n-node graph, or -1 if no such graph exists.

Table of values

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

List of values

[0, -1, -1, -1, -1, 6, 6, 6, 7, 8, 9, 10, 11, 12, 13, 13, 14, 15, 16, 17, 18, 19, 20, 21, 21, 22, 23, 24, 25, 26, 27, 28, 29, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 55, 56, 57, 58, 59]

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

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