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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127400 Number of segments of the longest possible zigzag paths fitting into a circle of diameter 3 if the path with index n is constructed according to the rules of the "Snakes on a Plane" problem of Al Zimmermann's programming contest. 2
6, 8, 17, 10, 20, 22, 27, 23, 34, 33, 51, 44, 52 (list; graph; refs; listen; history; internal format)
OFFSET

3,1

COMMENTS

The problems corresponding to n=3,4,6 had been excluded from the contest.

LINKS

Contest Organizers, Snakes on a plane.. Rules for the Fall 2006 round of Al Zimmermann's Programming Contests.

Contest Organizers, Al Zimmermann's Programming Contests - Snakes on a Plane

Hugo Pfoertner, Submitted Zigzag Paths Sorted by Problem Class. Contest results.

Hugo Pfoertner, Longest snake for n=13</>

Hugo Pfoertner, Longest snake for n=14

Hugo Pfoertner, Longest snake for n=15, first possible configuration.

Hugo Pfoertner, Longest snake for n=15, second possible configuration.

CROSSREFS

Cf. A127399 [solutions for container diameter 2], A127401 [solutions for container diameter 4], A122223, A122224, A122226 [solutions for hinge angles excluded from contest].

Sequence in context: A067543 A006583 A011989 * A025081 A162951 A032411

Adjacent sequences:  A127397 A127398 A127399 * A127401 A127402 A127403

KEYWORD

hard,more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Jan 12 2007

EXTENSIONS

a(13)-a(15) and update of links from Hugo Pfoertner (hugo(AT)pfoertner.org), Jul 02 2011

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 February 15 20:26 EST 2012. Contains 205852 sequences.