|
|
A159484
|
|
Upper bound arising in Hadwiger's conjecture.
|
|
1
|
|
|
0, 0, 110, 1054, 7097, 41201, 220171, 1115862, 5451131, 25919515, 120721773, 553162595, 2501388936, 11188504443, 49589159037, 218081007181, 952654230982, 4137309942806, 17876235129762, 76889316253171, 329384246847644, 1405944884946771, 5981601330173431
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
REFERENCES
|
Brass, Peter; Moser, William; Pach, Janos (2005), "3.3 Levi-Hadwiger Covering Problem and Illumination", Research Problems in Discrete Geometry, Springer-Verlag, pp. 136-142 .
|
|
LINKS
|
|
|
FORMULA
|
a(n) = floor((4^n)*(5*n*log(n))).
|
|
EXAMPLE
|
a(1) = (4^1) * (5 * 1 * log(1)) = 0.
a(2) = floor ((4^2) * (5 * 2 * log(2))) = floor(110.903549) = 110.
a(3) = floor(1054.6678) = 1054.
|
|
MATHEMATICA
|
Table[If[n==0, 0, Floor[(4^n)*(5*n*Log[n])]], {n, 0, 30}] (* G. C. Greubel, Jun 12 2018 *)
|
|
PROG
|
(PARI) for(n=0, 30, print1(if(n==0, 0, floor((4^n)*(5*n*log(n)))) , ", ")) \\ G. C. Greubel, Jun 12 2018
(Magma) [0] cat [ Floor((4^n)*(5*n*Log(n))) : n in [1..30]]; // G. C. Greubel, Jun 12 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|