login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182136 Diameter of rotation graph G_n. 0
1, 3, 5, 7, 10, 12, 15, 18, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

LINKS

Table of n, a(n) for n=2..10.

Fack, V.; Lievens, S.; Van der Jeugt, J. On the diameter of the rotation graph of binary coupling trees. Discrete Math. 245 (2002), no. 1-3, 1--18. MR1887046 (2003i:05047).

FORMULA

For n > 1, a(n) is bounded by (1/4)*n*log_2(n/e) < (1/4)*log_2(n!) < a(n) < ((n-2)*ceiling(log_2(n)))+n+1 (Fack et al. 2002). - Martin R. Smith, Jul 03 2020

CROSSREFS

Sequence in context: A020959 A175312 A057640 * A335408 A211266 A037030

Adjacent sequences:  A182133 A182134 A182135 * A182137 A182138 A182139

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Apr 14 2012

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 May 26 11:30 EDT 2022. Contains 354086 sequences. (Running on oeis4.)