id:A011187 - OEIS Search Results

Search: id:A011187

Displaying 1-1 of 1 results found.

page 1

Number of ways to choose 2^n vectors in {0, 1, 2, 3}^n such that any two differ by at least 2 in at least one coordinate (2^n being maximal).

+0
1

3, 79, 457645 (list; graph; listen)

	OFFSET	`1,1`
	CROSSREFS	`Sequence in context: A062660 A065399 A105065 this_sequence A137994 A153709 A074386` `Adjacent sequences: A011184 A011185 A011186 this_sequence A011188 A011189 A011190`
	KEYWORD	`nonn,bref,hard`
	AUTHOR	`Jan Kristian Haugland (jankrihau(AT)hotmail.com)`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.