

A080804


Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).


5



1, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 70, 71, 72, 73, 74, 75, 76, 77, 78
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


REFERENCES

P. Rosendahl, On identification problems in products of cycles, Discrete Mathematics, accepted 2003 for publication


LINKS

Table of n, a(n) for n=1..72.
R. Stephan, Some divideandconquer sequences ...
R. Stephan, Table of generating functions


FORMULA

a(n) = n + floor(log_2 n).


EXAMPLE

a(15)= 18 and a(16)=20.


CROSSREFS

Sequence in context: A039093 A085925 A107907 * A164386 A111909 A184010
Adjacent sequences: A080801 A080802 A080803 * A080805 A080806 A080807


KEYWORD

easy,nonn


AUTHOR

Pete Rosendahl (perosen(AT)utu.fi), Mar 26 2003


EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003


STATUS

approved



