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.

A133736 Number of graphs on n unlabeled nodes that have an Eulerian cycle, i.e., a cycle that goes through every edge in the graph exactly once.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 7
6 15
7 52
8 236
9 2018
10 33044
11 1181670
12 87720798
13 12886156666
14 3633055848955
15 1944000061673516
16 1967881435350411681
17 3768516013573481061951
18 13670271805989797561408684

List of values

[1, 1, 2, 3, 7, 15, 52, 236, 2018, 33044, 1181670, 87720798, 12886156666, 3633055848955, 1944000061673516, 1967881435350411681, 3768516013573481061951, 13670271805989797561408684]

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

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