Check out Alexander Graham Bell’s Tetrahedral Kites from Public Domain Review! (More photos if you follow the link!) publicdomainreview.org/collection/a...

@timchartier.bsky.social—and math can make you better at basketball?

@rmfrt.com—this made me think of you!

Check out Jiabao Li's project of "transforming abstract math into climbable sculptures," complete with a rendering of a mathematical playground! "What if others could literally play with math—climb on it, move around it, think about it differently?" infinitesums.simonsfoundation.org/math-ambassa...

Check out this gyroelongated triangular bicupola (J₄₄)!

This is indeed gorgeous and worth a read!

“By its conclusion, a massive quantity of weapons-grade uranium — enough for about 20,000 warheads — had been diluted and fashioned into fuel pellets. The resulting fuel supplied roughly 10% of all electricity generated in the U.S. during those 18 years.”

Check this amazing photo which was taken by Mona Hassan Abo-Abda of the Giza Pyramids during Forever is Now exhibition in Cairo, Egypt which won the Wiki Loves Monuments competition in 2023. www.wikilovesmonuments.org/galleries/20...

Number T(n,k) of colored set partitions of [n] where colors of the elements of subsets are distinct and in increasing order and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

For the last few months, I've been happy using RSS to keep up with the news publications I care about the most. However, I found it was tedious to initially compile that list of RSS feeds, and I couldn't find good lists online—so I made a guide to help you get started!

I made an animation of a camera traveling through a Boerdijk–Coxeter helix (en.wikipedia.org/wiki/Boerdij...)

Triangle of numbers of partitions of n with total number of odd parts equal to k from {0,...,n}.

Triangle T(n,d) read by rows: Number of ascent sequences of length n with d zeros.

I'm not sure I can explain it, but this is @motivickyle.bsky.social.

Hey! That’s the one in the profile picture!

Number T(n,k) of entries in the k-th cycles of all permutations of [n] when cycles are ordered by decreasing lengths (and increasing smallest elements); triangle T(n,k), n>=1, 1<=k<=n, read by rows.

Did you know... PMP made the front page of Wikipedia? Thank you, @wikipedia.org. We're thrilled to be featured in the "Did you know..." section on Pi Day. Happy Pi Day! 🥧🎉

Lately, I've been assigning my upper division math students "Choice Exercises" as a part of their homework assignments, where they get to choose from several options. When I taught Abstract Algebra in fall 2024, I asked students to say which problem was their favorite, which I've recorded here.

Given reports that Americans buy SUVs in part because the other cars on the road are big, it surprised me that "The likelihood that someone gets into a fatal collision while traveling to and from work [is] higher if they drive a heavy SUV or pickup truck with big blind spots instead of a […] sedan."

The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with exactly k parts (k>=1). Regular triangle read by rows: the rows are indexed by n, the number of vertices of the path, and the columns are indexed by k, the number of parts.

Check out @fdecomite.bsky.social’s incredible shelf based on Squaring the Square!

Inspired by @robinhouston.mathstodon.xyz.ap.brid.gy's G4G16 gift of tetragonal disphenoidal blocks, I've made some magnetized versions, which are satisfyingly click-y!

Triangle read by rows: T(n,k) = number of step shifted (decimated) sequence structures of length n using exactly k different symbols.

I wrote a blog post about my G4G16 gift. If you want a copy of your own, download and print the files!

Enlarging 3D printed models. I am imagining the structure of our physical universe just above the Planck scale, where quantum forces overcome the force of gravity. If you are exploring the fundamental structure of three dimensional form, this is the place to be!

Petition: Christopher Havens is an inmate in the Washington state prison system who has been collaborating on mathematics with people both inside and outside prison. He was recommended for clemency by the parole board. However, governor Bob Ferguson has not granted it yet. (link below)

Peter has a nice blog post about making his card. Check it out peterkagey.com/blog/2025/12...

I got some nice #ptpx cards in the mail today. Thanks @peterkagey.com @aotearoan!

Three podcasts that I loved that have since stopped releasing new episodes, but which I wish more people knew about. – Hakai Magazine Audio Edition – Ox Tales (by the Oxford Symposium on Food and Cookery) – 70 Over 70 (by Pineapple Street Studios) Please recommend defunct podcasts to me too!

I wrote about the postcard I designed for the 2025 plotter postcard exchange #ptpx on my blog, based on a potato-based game that M.C. Escher used to play with his kids.

Don Knuth just published OEIS sequence: "A391478: T(m,n) is the number of Hamiltonian cycles on an m×n torus where each step goes north (N), east (E), or northeast (NE), with 2 ≤ n ≤ m." It references three sequences, two of which are sequences I published in 2019!

I wrote a blog post about human polyhedra, which truly *embodies* mathematics.

In October 2014, a few months out of college, I made my first web app so users could submit examples of constructions of upper bounds for a graph theory problem. This last week, I've updated it to make it more mobile-friendly and colorful! Try it out and see if you can improve any of the bounds!

I am absolutely buzzing following the publication of my very first OEIS sequence. oeis.org/A389751 Numbers k such that k^3 can be represented as the sum of k consecutive nonprimes. Eg a(3) = 9^3 = 76+77+78+80+81+82+84+85+86 Only the first 16 numbers found so far, so please come and add more!

Check out my new blog post on a prototype shelf that I designed and made out of cardboard based on the "squaring the square" problem, which asks if you can partition a square into smaller squares all of different sizes. (You can!) Come for the photos, stay for the 3D model!

I got a shoutout in the 245th edition of Carnival of Mathematics!

Looks like #plotparty postcards have landed in mailboxes! Read my new blog post about the cards I designed.

HMC CS prof Lucas Bang is helping students gain access to learning & networking opportunities in the computer programming languages field. Bang received a three-year NSF grant to fund as many as 10 students per year to attend international workshops in programming languages. uqr.to/bang-nsf.

Triangle T(m,n) giving of number of steps in the Euclidean algorithm for gcd(m,n) with 0<=m<n.

Five years ago today, I asked a question on Stack Exchange about the number of "n-polytets," which are ways of gluing n tetrahedra together. Recently user Deadcode (David Ellsworth) answered the question and used some novel ideas to extend OEIS sequence oeis.org/A276272 from a(6)–a(17)!

I wrote a blog post about how I made an RSS feed that allows you to get updated when new sequences matching your search are added to the On-Line Encyclopedia of Integer Sequences (OEIS).

Arbitrarily Close: An Introduction to Real Analysis has been published by 619 Wreath! Free PDF, Desmos, and GeoGebra available on my faculty webpage (at least for the time being): www.cpp.edu/faculty/jaro... Hardcover and paperback copies are available from 619 Wreath: www.619wreath.com/acl.html

I made a RSS feed that to see when new sequences are posted to the On-Line Encyclopedia of Integer Sequences (OEIS). For example, if you want to see all of my new sequences or all those with keyword "nice", subscribe to api.peterkagey.com/oeis_feed.xm... api.peterkagey.com/oeis_feed.xm...

I recently wrote a story about Peter Putnam, a forgotten physicist-turned-janitor with a groundbreaking theory of the mind, for @nautil.us. I was able to piece together Putnam's incredible story thanks to a few people who kept the ember of his work glowing for decades after his tragic death.

Every Cobb salad is a macabre salad to me (because of the bacon).

T(n,k) is the number number of partitions of n into distinct odd parts, where every part is ≤ k.

Tomorrow's the last day to get the "early bird" registration price for the Gathering 4 Gardner conference. This time, it will be in San Francisco! Featured speakers include computer scientist Donald Knuth, Mythbuster's Adam Savage, and Pixar's Danielle Feinberg. www.gathering4gardner.org/g4g16-info/

Cool! Bert Dobbelaere and I counted that there are 10924738869 ways of putting 19 of these together! (oeis.org/A385024)

Celebrated the centennial of the MAA SoCal-Nevada Section this afternoon by building the MAA icosahedron logo in real life! Designed by Glen Whitney, who oversaw the construction. @joinmaa.bsky.social