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.

A375619 a(n) is the largest integer such that there exists a simple graph with n vertices, a(n) edges, and no cycles of length 0 mod 4.

Table of values

n a(n)
1 0
2 1
3 3
4 4
5 6
6 7
7 9
8 11
9 12
10 14
11 15
12 17
13 19
14 20
15 22
16 23
17 25
18 26
19 28
20 30
21 31
22 33
23 34
24 36
25 38
26 39
27 41
28 42
29 44
30 45
31 47
32 49
33 50
34 52
35 53
36 55
37 57
38 58
39 60
40 61
41 63
42 64
43 66
44 68
45 69
46 71
47 72
48 74
49 76
50 77
51 79
52 80
53 82
54 83
55 85
56 87
57 88
58 90
59 91
60 93
61 95
62 96
63 98
64 99
65 101
66 102

List of values

[0, 1, 3, 4, 6, 7, 9, 11, 12, 14, 15, 17, 19, 20, 22, 23, 25, 26, 28, 30, 31, 33, 34, 36, 38, 39, 41, 42, 44, 45, 47, 49, 50, 52, 53, 55, 57, 58, 60, 61, 63, 64, 66, 68, 69, 71, 72, 74, 76, 77, 79, 80, 82, 83, 85, 87, 88, 90, 91, 93, 95, 96, 98, 99, 101, 102]