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.

A227724 T(n,k) = number of small equivalence classes of half full n-ary Boolean functions that contain 2^k functions.

This page as a plain text file.
%I A227724 #22 Oct 31 2021 22:57:13
%S A227724 0,0,1,0,3,0,0,7,0,7,0,15,0,105,750
%N A227724 T(n,k) = number of small equivalence classes of half full n-ary Boolean functions that contain 2^k functions.
%C A227724 Like A227725, but counting only small equivalence classes (sec) of half full Boolean functions, i.e. those with an equal number of zeros and ones.
%H A227724 Tilman Piesk, <a href="http://en.wikiversity.org/wiki/3-ary_Boolean_functions;_half_full_secs">Example for row 3</a>
%H A227724 Tilman Piesk, <a href="http://en.wikiversity.org/wiki/Equivalence_classes_of_Boolean_functions#sec">Small equivalence classes of Boolean functions</a>
%H A227724 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%e A227724 Triangle begins:             Row sums (central numbers of A054724)
%e A227724             0                        0
%e A227724          0     1                     1
%e A227724       0     3     0                  3
%e A227724    0     7     0     7              14
%e A227724 0    15     0    105   750         870
%Y A227724 Cf. A227725, A054724, A000225.
%K A227724 nonn,tabl,more
%O A227724 0,5
%A A227724 _Tilman Piesk_, Jul 22 2013