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.

A382281 Let n encode the edges of a graph by taking edges (u,v), with u < v, in colexicographic order ((0,1), (0,2), (1,2), (0,3), ...) and adding each edge to the graph if the corresponding binary digit of n (starting with the least significant digit) is 1. a(n) is the smallest nonnegative integer that encodes the same unlabeled graph as n (disregarding any isolated vertices), i.e., the code of the graph as defined in A076184.

Table of values

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

List of values

[0, 1, 1, 3, 1, 3, 3, 7, 1, 3, 3, 11, 12, 13, 13, 15, 1, 3, 12, 13, 3, 11, 13, 15, 3, 7, 13, 15, 13, 15, 30, 31, 1, 12, 3, 13, 3, 13, 11, 15, 3, 13, 7, 15, 13, 30, 15, 31, 3, 13, 13, 30, 7, 15, 15, 31, 11, 15, 15, 31, 15, 31, 31, 63, 1, 3, 3, 11, 12, 13, 13, 15]

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

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