|
%I #8 Mar 29 2014 10:58:55
%S 1,2,4,8,12,16,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,
%T 56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,88,90,92,94,96,98,
%U 100,102,104,106,108,110
%N Arises in quick gossiping without duplicate transmission.
%C As explained in Seress, there are n persons each knowing a piece of gossip not known to the others. They communicate by telephone and whenever two persons talk they tell the other all of the gossip they know at that time. a(n) lists those n for which there exists a number of economical calls, that is, the minimum, with the additional constraint that everybody hears each piece of gossip exactly once.
%D B. Baker and R. Shostak, "Gossips and Telephones", Discrete Math, 2(191-193, 1972.
%D Akos Seress, "Quick Gossiping Without Duplicate Transmission", Proceedings of the Third International Conference on Combinatorial Mathematics, Pages 375 - 382, New York Academy of Sciences New York, NY, 1989.
%F {1, 2, 4, 8, 12, 16} UNION {n:n >= 20 and 2|n}.
%K nonn,easy
%O 1,2
%A _Jonathan Vos Post_, Aug 11 2012
|
