Centered Polygonal Number¶
A figurate number formed from one central point and successive k-sided dot rings, with one-based count C_k(n)=1+k n(n−1)/2.
Core Idea¶
A centered polygonal number counts a dot pattern that starts with one central point and grows by surrounding it with successively larger regular k-sided rings. For fixed integer k at least three, the first term is just the center. The next layer contributes k dots; the following contributes 2k; in general the nth step contributes k(n−1). Consequently, with the center indexed as n=1, the count is Cₖ(n)=1+k n(n−1)/2. The formula is not a visual approximation; it is the cumulative count of the ring increments.[1][2]
The parameter k gives a coherent family, not one sequence. At k=3 the counts begin 1, 4, 10, 19; at k=4, 1, 5, 13, 25; at k=6, 1, 7, 19, 37. The shape changes, but the invariant center-plus-linear-ring-growth rule remains. An ordinary polygonal number is a near neighbor, but its diagram expands from a vertex/corner and follows a different count. The expression also equals one plus k times a triangular number, yet that algebraic relationship does not turn every centered polygonal number into the triangular sequence itself.[1][2]
Structural Signature¶
Sig role-phrases: one center → fixed polygon side count → concentric rings → linear ring increments → cumulative quadratic count → declared index convention.
- Single center: One dot seeds the entire construction. Without that initial one, the same ring increments yield a different family of totals.[1]
- Fixed side count k: The number of sides, at least three in the ordinary geometric reading, determines whether this is the centered triangular, square, hexagonal, or another member. It stays fixed while the ring index grows.[2]
- Concentric ring growth: New dots are arranged around the existing figure in a k-sided layer. A merely k-sided outline with arbitrary dot counts is insufficient; the rings must follow the family rule.[1]
- Linear ring increment: The nth surrounding growth contributes k(n−1) dots when the center is term one. This is the constitutive count connecting the geometry to the recurrence.[2]
- Cumulative total: Summing the increments gives 1+k times the triangular number n(n−1)/2. The formula supplies an exact membership test independent of how a diagram is drawn.[1][2]
- Index convention: Some references call the central dot ring zero rather than term one. The underlying shapes are unchanged, but their formulas shift. A comparison must state which convention is in use.[2]
What It Is Not¶
It is not an ordinary polygonal number just because both families use the word triangular or hexagonal. Ordinary polygonal arrangements grow from a corner, whereas the centered family grows outward from a central point. At n=3, the centered hexagonal count is 19, while the ordinary hexagonal number under its standard indexing is 15.[1]
It is not every dot arrangement with a center. If the second ring has an irregular count, or the side count changes as the figure grows, the sequence may be interesting but it is no longer the centered k-gonal family under a fixed k. Nor is the identity “a number equal to 1 modulo k” sufficient: the formula imposes the more restrictive triangular factor n(n−1)/2.
The cube-sum identity for centered hexagonal numbers is a consequence of one member, not a defining condition of the whole family. If it fails for centered square numbers, that does not invalidate the general construction.[3]
Scope of Application¶
The abstraction is a mathematical figurate-number family. It can be used to pass between visual layer-counting, recurrence relations, closed formulas, generating-function work, and identities involving particular side counts. Its scope is not a claim that every physical honeycomb or decorative polygon is a centered polygonal number: a real arrangement must match the discrete ring counts.[1][2]
The triangular, square and hexagonal instances test the general rule under different k. In each, a fixed side count multiplies a linearly growing ring index. Derived properties can be narrower. The sum of the first n centered hexagonal counts equals n³ in this one-based convention, but that is a theorem about k=6, not permission to generalize cube sums to all k.[3]
Clarity¶
The centered construction separates three easily conflated objects: the geometric arrangement, the sequence term, and an identity involving the term. A diagram gives an intuitive witness, the formula decides the value, and a relation such as a cube sum is a downstream fact. Naming the levels prevents a coincidence at one term from being mistaken for equivalence of two sequences.
It also clarifies indexing disagreements. A sequence written 1, 7, 19 can be labeled by n=1,2,3 or by m=0,1,2. In the latter convention the same counts use 1+k m(m+1)/2. A reported mismatch should first be tested for this shift before one concludes that the constructions differ.[2]
Manages Complexity¶
Instead of memorizing separate formulas for centered triangular, square, pentagonal, hexagonal and higher patterns, one keeps a small parameter set: fixed k, term index n, initial count one, and linear ring increment k(n−1). That compact rule reconstructs the whole family and makes comparisons between members mechanical. For a fixed n, increasing k by one adds exactly n(n−1)/2 dots.[2]
Compression has a boundary: the general formula tells us the counts, not every special relation of every family member. Some identities arise from geometry or algebra peculiar to a chosen k. The common rule helps locate those special results without pretending they are universal.
Abstract Reasoning¶
To test a proposed centered k-gonal sequence, first check its initial value is one. Then compute successive differences. If the differences are k,2k,3k,... for a fixed integer k≥3, the recurrence supports the centered-ring reading. Summing the arithmetic progression proves the closed form. Conversely, subtracting consecutive closed-form terms recovers the ring increment, so diagram, recurrence and formula test one another.[1][2]
This also provides a controlled comparison to ordinary polygonal numbers: evaluate both at the same declared index and examine their construction and difference sequence. Matching one numeral is insufficient evidence of identical types. A special member's identity—such as the hexagonal cube sum—can then be proved separately by summing its quadratic term formula rather than importing it into the definition.[3]
Knowledge Transfer¶
Literal transfer within mathematics takes the center + fixed-sided layer + arithmetic progression of ring sizes rule from one k to another. The same recurrence proof covers centered square and centered hexagonal patterns after substituting the side count. A proof about one special k, however, does not automatically travel across the family.
Outside figurate-number theory, phrases such as “growth around a center” are at most analogy unless the discrete counts follow the exact rule. The live Arithmetic Progression entry describes the successive ring increments, but the accumulated centered count is a different mathematical object. This named family remains domain-specific because its diagnostic objects are exact integer dot arrangements, not a portable mechanism established in unrelated fields.
Examples¶
Centered square at term three. Begin with one dot. Add a four-sided ring of four, then a second ring of eight. The total is 1+4+8=13. Mapped back: center = initial dot; side count = k=4; rings = two surrounding square layers; increments = 4 and 8; cumulative total = C₄(3)=13; index = the center is term one.[2]
Centered hexagonal at term three. Begin with one dot, add six around it, then twelve in the next hexagonal ring. The total is 1+6+12=19. Mapped back: center = initial dot; side count = k=6; rings = two surrounding hexagonal layers; increments = 6 and 12; cumulative total = C₆(3)=19; index = the center is term one. The first three hexagonal values sum to 1+7+19=27=3³, a derived identity rather than an extra condition on this example.[2][3]
Structural Tensions¶
Picture versus exact arithmetic. A picture communicates the ring construction quickly, but visual resemblance can conceal a wrong dot count. Diagnostic: Does each new ring add the prescribed multiple of k?[1]
One-based versus zero-based indexing. Either convention enumerates the same arrangements; mixing them in a formula creates an apparent contradiction. Diagnostic: Is the center term one or ring zero in this source?[2]
General family versus member-specific theorem. The parameterized formula unifies all side counts, while a cube-sum result is specific to hexagonal members. Diagnostic: Has a claimed relation been proved for arbitrary k, or only for a selected value?[3]
Structural–Framed Character¶
On the structural–framed spectrum, this is strongly structural: the same fixed-k ring increment and cumulative count decide membership regardless of who draws the dots or where the diagram is displayed. A new arrangement can be checked by subtraction of consecutive terms rather than by a curator's impression of polygonal appearance.[1][2]
Its evaluative weight is negligible. “Centered” locates the starting point of the figurate construction; it does not praise the number, confer optimality, or state that one geometric layout is preferable. Interesting downstream identities, such as the hexagonal cube sum, may motivate study but are not evaluative conditions of membership.[3]
Its human-practice dependence is limited to representation and indexing. Authors draw rings and choose whether to call the center term one or ring zero. Once a convention is fixed, the dot counts and recurrence are mathematical facts, not matters of human preference. A diagram may be poorly drawn yet still represent the same sequence if its intended ring counts are explicit.[2]
Its institutional origin is mathematical cataloguing of figurate numbers, not an authority's grant of category membership. OEIS and MathWorld document the family, but a sequence satisfying the formula does not depend on either institution's approval. Their catalogues provide traceable notation and examples; the definition rests on the count.[1][2]
Its vocabulary travels within number theory and mathematical visualization when center, polygon side count, and ring increment keep their literal meanings. Calling a management organization with a central office and regional layers a “centered polygonal number” would import an analogy, not recognize the same integer construction. A physical dot pattern is a genuine instance only if it realizes the exact discrete counts. Its character: a highly structural mathematical identity with mild representational framing, whose named scope remains figurate-number theory rather than an established cross-domain prime.[1][2]
Structural Core vs. Domain Accent¶
The portable skeleton is a seed plus an arithmetic progression of layer increments, cumulatively summed. The live Arithmetic Progression entry describes the increment sequence, not the resulting family of centered dot counts. The live Accumulation prime is specifically a stock changing through net flows over time, and Recurrence concerns lagged reappearance of states; neither can be imported as a parent merely because the arithmetic uses a sum or a difference equation. A cross-domain “layered arithmetic growth” prime would be a separately evidenced future-prime question, not established by the current sources.[1][2]
The domain accent is decisive: k is the side count of a discrete polygonal dot arrangement, the index is an integer ring count, and membership is the exact equality Cₖ(n)=1+k n(n−1)/2. These specifics distinguish the family from arbitrary cumulative systems. A geometric sketch helps communicate them, but the ring-count rule, not visual resemblance, supplies the mathematical test.[1][2]
Why not prime: All directly evidenced positive cases—triangular, square, hexagonal, and higher—are members of one figurate-number domain. No independent domains have been shown to use the named identity with the same exact ring-count diagnostics. The possibility of a broader layered-growth idea does not make the exact centered k-gonal number a cross-domain prime.
Instantiates / Related Primes¶
Arithmetic Progression is a live domain-specific neighbor: the ring increments k,2k,3k,... form such a sequence, but an increment sequence is not itself a centered polygonal number. Accumulation and Recurrence are explicitly declined as prime parents because their live signatures require, respectively, stock–flow dynamics and lagged reappearance—not generic arithmetic summation or a sequence difference equation. A strict DAG edge to Arithmetic Progression would require a separate structural-prerequisite test; no such edge is asserted here. Triangular numbers are algebraically related through the formula but not identity duplicates.
Neighborhood in Abstraction Space¶
Centered Polygonal Number sits in a sparse region of the domain-specific corpus (82nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Algebraic Substructures & Closures (12 abstractions)
Nearest neighbors
- Circular arc — 0.84
- Ring Ideal — 0.83
- Nine-Point Conic — 0.82
- Polygon — 0.81
- Missing Middle Housing — 0.81
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
- Ordinary polygonal numbers: vertex-grown arrangements with a different indexing formula.[1]
- A single centered square or hexagonal number: members of the parameterized family, not synonyms for every k.
- Triangular numbers: a factor in the general formula, not the complete centered count.
- Any centered drawing: the exact ring increments are necessary.
References¶
[1] Eric W. Weisstein, “Centered Polygonal Number,” Wolfram MathWorld, centered-versus-vertex-grown definition; the general formula is from OEIS and the ring-sum derivation, not this page. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o
[2] “Centered polygonal numbers,” OEIS Wiki, family formula and sequence table; indexing cross-checked against the displayed values. registry ↩a ↩b ↩c ↩d ↩e ↩f ↩g ↩h ↩i ↩j ↩k ↩l ↩m ↩n ↩o ↩p ↩q ↩r ↩s
[3] Eric W. Weisstein, “Hex Number,” Wolfram MathWorld, centered-hexagonal terms and partial-sum identity, converted consistently to one-based indexing. registry ↩a ↩b ↩c ↩d ↩e ↩f