|
Search: id:A007456
|
|
|
| A007456 |
|
Days required to spread gossip to n people. |
|
+0
4
|
|
| 0, 1, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8, 7, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
On first day, each gossip has his own tidbit. On each successive day, disjoint pairs of gossips may share tidbits (over the phone). After a(n) days, all gossips have all tidbits.
|
|
REFERENCES
|
Fan, C. Kenneth, Bjorn Poonen and George Poonen, How to spread rumors fast. Mathematics Magazine 70 (Feb, 1997), pp. 40-42.
D. Shasha, Gossiping Defenders, The Puzzling Adventures of Dr. Ecco, pp. 62-4;156 W. H. Freeman NY 1988.
|
|
LINKS
|
I. Peterson, Spreading Rumors, MathLand, March 17, 1997.
|
|
FORMULA
|
a(n) = [ log_2 n+1 ] + (n mod 2) + 1 (n > 1)
G.f.: 1/(1-z)*(sum(k>=0, z^(2^k))+1/(1+z)). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Apr 06 2003
|
|
CROSSREFS
|
Adjacent sequences: A007453 A007454 A007455 this_sequence A007457 A007458 A007459
Sequence in context: A025509 A130079 A134559 this_sequence A119707 A052938 A140114
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
Alex Graesser (AlexG(AT)sni.co.za)
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
