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.

A374819 Triangle read by rows: T(n,k) is the number of functions on the Boolean lattice B_n satisfying f({}) =0, f([n])=k, and the Boolean growth rule: f(J union {i})-f(J) in {0,1} for all subsets J of [n]={1, ..., n} and all i in [n]\J, 0 <= k <= n.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 4
5 1
6 1
7 18
8 18
9 1
10 1
11 166
12 656
13 166
14 1
15 1
16 7579
17 189967
18 189967
19 7579
20 1
21 1
22 7828352

List of values

[1, 1, 1, 1, 4, 1, 1, 18, 18, 1, 1, 166, 656, 166, 1, 1, 7579, 189967, 189967, 7579, 1, 1, 7828352]

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

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