Anonymous
Not logged in
British English
Log in
Vigyanwiki
Search
Template
:
Central polygonal numbers.svg
From Vigyanwiki
Namespaces
Template
Discussion
More
More
Page actions
Read
View source
History
Central polygonal numbers.svg
The maximum number of pieces,
p
obtainable with
n
straight cuts is the
n
-th triangular number plus one, forming the lazy caterer's sequence (OEIS A000124)
Navigation
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Wiki tools
Wiki tools
Special pages
Page tools
Page tools
User page tools
More
What links here
Related changes
Printable version
Permanent link
Page information
Page logs
Other projects
In other languages
Add links