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.

A131288 a(n) = number of ways to choose a collection C of subsets of U = [1,2,...,n] such that Union_{S in C} = U, Intersection_{S in C} = empty set.

Table of values

n a(n)
0 2
1 1
2 7
3 193
4 63775
5 4294321153
6 18446744022173838463
7 340282366920938463205120190760593525761
8 115792089237316195423570985008687907847825466794905548626109625623336235655679

List of values

[2, 1, 7, 193, 63775, 4294321153, 18446744022173838463, 340282366920938463205120190760593525761, 115792089237316195423570985008687907847825466794905548626109625623336235655679]