1,1

Lower bound of formula (12) on p.13. For some constants C1 and C2 the paper proves that C1*a(n) <= the number of points in the n-th stage <= C2*(4^4^n). Abstract: Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoivi'c (2003) showed that the limiting set is dense in the plane. We give doubly exponential upper and lower bounds on the number of points at each stage. The proof employs a variant of the Szemeredi-Trotter Theorem and an analysis of the "minimum degree" of the growing configuration.

Joshua Cooper and Mark Walters, Iterated Point-Line Configurations Grow Doubly-Exponentially

a(n) = Floor(4^(1.0488^n)).

a(50) = 3314300 because 4^(1.0488^50) = 3314300.96.

a(51) = 6895838 because 4^(1.0488^51) = 6895838.31.

a(52) = 14869970 because 4^(1.0488^52) = 14869970.9.

Sequence in context: A006264 A134994 A138195 this_sequence A139324 A111655 A113646

Adjacent sequences: A140741 A140742 A140743 this_sequence A140745 A140746 A140747

easy,nonn,less

Jonathan Vos Post (jvospost3(AT)gmail.com), Jul 12 2008