0,1

A Boolean function is ultrasweet if it is sweet (see A114302) under all permutations of the variables.

For all n>1, a function like "x2" is counted in the present sequence but not in A114572.

Cf. A114303, A114303, A114572.

Adjacent sequences: A114488 A114489 A114490 this_sequence A114492 A114493 A114494

Sequence in context: A018284 A078344 A024498 this_sequence A122939 A003183 A131788

nonn

D. E. Knuth, Aug 17 2008