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.

A006237 Complexity of tensor sum of n graphs; or spanning trees on n-cube.

Table of values

n a(n)
0 1
1 1
2 4
3 384
4 42467328
5 20776019874734407680
6 1657509127047778993870601546036901052416000000
7 153850844349814660487100539994381178281567942393055761257560677644718869248475136000000000000000000000

List of values

[1, 1, 4, 384, 42467328, 20776019874734407680, 1657509127047778993870601546036901052416000000, 153850844349814660487100539994381178281567942393055761257560677644718869248475136000000000000000000000]

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

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