id:A051486 - OEIS Search Results

Search: id:A051486

Displaying 1-1 of 1 results found.

page 1

Triangle T(n,k) = number of symmetric Boolean functions of n variables and rank from 0 to 2^n.

+0
2

1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 2, 4, 2, 1, 2, 1, 1, 2, 1, 0, 2, 4, 3, 2, 2, 2, 3, 4, 2, 0, 1, 2, 1, 1, 2, 1, 0, 0, 2, 4, 2, 0, 0, 3, 6, 3, 0, 0, 4, 8, 4, 0, 0, 3, 6, 3, 0, 0, 2, 4, 2, 0, 0, 1, 2, 1, 1, 2, 1, 0, 0, 0, 2, 4, 2, 0, 0, 0, 1, 2, 1, 2, 4, 2, 0, 0, 1, 6, 9, 4, 0, 0, 2, 6, 6, 2 (list; graph; listen)

	OFFSET	`0,4`
	LINKS	`Index entries for sequences related to Boolean functions`
	EXAMPLE	`[1, 1], [1, 2, 1], [1, 2, 2, 2, 1], [1, 2, 1, 2, 4, 2, 1, 2, 1], ...`
	CROSSREFS	`Row sums give A011782.` `Sequence in context: A029256 A109073 A026465 this_sequence A081355 A060778 A096492` `Adjacent sequences: A051483 A051484 A051485 this_sequence A051487 A051488 A051489`
	KEYWORD	`nonn,tabf,nice`
	AUTHOR	`Vladeta Jovovic (vladeta(AT)Eunet.yu)`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research