login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A011187 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
3, 79, 457645 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Sequence in context: A062660 A065399 A105065 * A197248 A183265 A137994

Adjacent sequences:  A011184 A011185 A011186 * A011188 A011189 A011190

KEYWORD

nonn,bref,hard

AUTHOR

Jan Kristian Haugland (jankrihau(AT)hotmail.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 16:45 EST 2012. Contains 205938 sequences.