A053874 - OEIS

A053874

Triangle T(n,k) = number of Boolean functions mapping {0,1}^n to {0,1}^n with image of size k (k = 0...2^n) under action of GL(n,2).

1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 3, 4, 3, 2, 2, 1, 1, 2, 2, 3, 5, 7, 9, 11, 12, 11, 9, 7, 5, 3, 2, 2, 1, 1, 2, 2, 3, 5, 8, 14, 23, 35, 55, 84, 117, 158, 204, 242, 274, 290, 274, 242, 204, 158, 117, 84, 55, 35, 23, 14, 8, 5, 3, 2, 2, 1, 1, 2, 2, 3, 5, 8, 15, 29, 54, 107, 227, 495, 1131

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..80.

Sean A. Irvine, Java program (github)

Index entries for sequences related to Boolean functions

EXAMPLE

Triangle begins:

1, 2, 1;

1, 2, 2, 2, 1;

1, 2, 2, 3, 4, 3, 2, 2, 1;