login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090338 Number of full n-flups. 2
1, 1, 1, 1, 1, 6, 43, 922, 38609 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

COMMENTS

The full n-flups are the topologically distinct planar configurations of n straight line segments such that each segment crosses each other segment at exactly one intersection point; no two intersection points coincide; and no intersection point coincides with a segment's endpoint. a(n) also gives the number of distinct ways to divide a cake with n vertical cuts such that the maximal number of pieces results (see A000125).

LINKS

Table of n, a(n) for n=0..8.

Jon Wild and Laurence Reeves, Illustration of a(5)

EXAMPLE

See illustration of a(5), the full pentaflups. Of the six, the last shown does not have reflectional symmetry, but we do not count its mirror image as distinct. All six are drawn with lines at equally-spaced angles; it is usually (but not always) possible to achieve this (41 out of 43 of the full 6-flups, for example, have equi-angled drawings)

CROSSREFS

Cf. A000125, A090339.

Sequence in context: A062266 A217485 A159604 * A090339 A225159 A078810

Adjacent sequences:  A090335 A090336 A090337 * A090339 A090340 A090341

KEYWORD

more,nonn,hard

AUTHOR

Jon Wild and Laurence Reeves (l(AT)bergbland.info), Jan 27 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 22 20:33 EDT 2013. Contains 225574 sequences.