Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067158
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067158 Number of regions in regular n-gon which are 11-gons. +0
9
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 29, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 99, 0, 0, 102, 103, 0, 0, 0, 0, 108, 0 (list; graph; listen)
OFFSET

11,19

REFERENCES

B. Poonen and M. Rubinstein, Number of Intersection Points Made by the Diagonals of a Regular Polygon, SIAM J. Discrete Mathematics, Vol. 11, pp. 135-156.

LINKS

Sascha Kurz, m-gons in regular n-gons

B. Poonen and M. Rubinstein, The number of intersection points made by the diagonals of a regular polygon, SIAM J. on Discrete Mathematics, Vol. 11, No. 1, 135-156 (1998).

Sequences formed by drawing all diagonals in regular polygon

EXAMPLE

a(11)=1 because drawing the regular 11-gon with all its diagonals yields 1 11-gon.

CROSSREFS

Cf. A007678, A064869, A067151, A067152, A067153, A067154, A067155, A067156, A067157, A067159.

Sequence in context: A137942 A099090 A123269 this_sequence A092995 A040847 A040848

Adjacent sequences: A067155 A067156 A067157 this_sequence A067159 A067160 A067161

KEYWORD

easy,nonn

AUTHOR

Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 06 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research