Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128650
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128650 Number of polygons on n vertices with exactly three faces. +0
2
0, 4, 16, 60, 224, 840, 3168, 12012, 45760, 175032, 671840, 2586584, 9984576, 38630800, 149768640, 581690700, 2262890880, 8815845720, 34389986400, 134312002440, 525129633600, 2055166429680, 8050465600320, 31561484455800 (list; graph; listen)
OFFSET

2,2

LINKS

T. Mansour and S. Severini, Grid polygons from permutations and their enumeration by the kernel method

FORMULA

a(n) = 4(n-2)/(n-1) * C(2n-4,n-2). For n>2, a(n) = 4*A001791(n-2).

CROSSREFS

Sequence in context: A089883 A089932 A120926 this_sequence A072335 A081161 A032106

Adjacent sequences: A128647 A128648 A128649 this_sequence A128651 A128652 A128653

KEYWORD

nonn

AUTHOR

Ralf Stephan, May 08 2007

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research