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.

A363197 a(n) is the number of ways the labels 1 to 2^n-1 can be assigned to a perfect binary tree with n levels such that there is an ordering between children and parents and also an ordering between the left and the right child.

Table of values

n a(n)
1 1
2 1
3 10
4 343200
5 73082837755699200000
6 79548797573848497198355214730517854838277265162240000000000

List of values

[1, 1, 10, 343200, 73082837755699200000, 79548797573848497198355214730517854838277265162240000000000]

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

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