A square pyramidal number counts the number of stacked spheres that can be arranged into a pyramid with a square base, one layer at a time, and belongs to the broader family of figurate numbers studied since antiquity by mathematicians including Archimedes and Fibonacci. Algebraically, the nth square pyramidal number is the sum of the first n perfect squares, and it can also be written as the value of a cubic polynomial in n. Beyond counting cannonballs or oranges stacked in a pyramid, these numbers solve other counting problems, such as the number of squares that can be found within a square grid, and they relate to other figurate numbers: the sum of two consecutive square pyramidal numbers is always an octahedral number. A famous exchange between Walter Raleigh and Thomas Harriot about how to count stacked cannonballs eventually led to the discovery that only two numbers, 1 and 4900, are both square and square pyramidal at once. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Square Pyramidal Number (Wikipedia)
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.