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.

A068393 Number of partitions of n X n checkerboard by two edgewise-connected sets which produce the maximum n^2-2n+2 frontier edges between the two sets. Partitions equal under rotation or reflection are counted only once.

Table of values

n a(n)
2 2
3 3
4 7
5 44
6 494
7 748827
8 99987552
9 23904291912
10 23904291912
11 14647978829979
12 16186345621426754
13 45843626565163628751
14 235646717730827228414584
15 3099290829556018890177304005

List of values

[2, 3, 7, 44, 494, 748827, 99987552, 23904291912, 23904291912, 14647978829979, 16186345621426754, 45843626565163628751, 235646717730827228414584, 3099290829556018890177304005]