login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A317185
Number of edges in a minimum gossip graph on n nodes.
0
0, 1, 2, 4, 5, 6, 7, 12, 9, 13, 11, 18
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,3
LINKS
Table of n, a(n) for n=1..12.
Guillaume Fertin,
A study of minimum gossip graphs
, Discrete Mathematics 215.1-3 (2000): 33-57.
CROSSREFS
Sequence in context:
A246965
A300861
A039057
*
A276005
A092058
A134532
Adjacent sequences:
A317182
A317183
A317184
*
A317186
A317187
A317188
KEYWORD
nonn
,
more
AUTHOR
N. J. A. Sloane
, Jul 26 2018
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified April 19 02:12 EDT 2024. Contains 371782 sequences. (Running on oeis4.)