<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"><channel><description>Maker, Educator, Mathematician | Assistant Professor at Cal Poly Pomona&#xA;&#xA;“My interests include music, science, justice, animals, shapes, feelings” —Lisa Simpson&#xA;&#xA;Creator of @oeistriangles.peterkagey.com.</description><link>https://bsky.app/profile/peterkagey.com</link><title>@peterkagey.com - Peter Kagey</title><item><link>https://bsky.app/profile/peterkagey.com/post/3mjp6n6i2is2p</link><description>Triangle of numbers of partitions of n with total number of odd parts equal to k from {0,...,n}.&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>17 Apr 2026 14:56 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mjp6n6i2is2p</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mjf3wo7tu222</link><description>Triangle T(n,d) read by rows: Number of ascent sequences of length n with d zeros.&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>13 Apr 2026 14:41 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mjf3wo7tu222</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3miyo47zvtk2q</link><description>I&#39;m not sure I can explain it, but this is @motivickyle.bsky.social.&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>08 Apr 2026 16:01 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3miyo47zvtk2q</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mhkyjzglrc2v</link><description>Hey! That’s the one in the profile picture!&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>21 Mar 2026 12:05 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mhkyjzglrc2v</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mh4lzrsbec2p</link><description>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&gt;=1, 1&lt;=k&lt;=n, read by rows.&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>15 Mar 2026 18:44 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mh4lzrsbec2p</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mgy2imyvxk26</link><description>Lately, I&#39;ve been assigning my upper division math students &#34;Choice Exercises&#34; as a part of their homework assignments, where they get to choose from several options.&#xA;&#xA;When I taught Abstract Algebra in fall 2024, I asked students to say which problem was their favorite, which I&#39;ve recorded here.&#xA;https://peterkagey.com/blog/2026/03/favorite_problems_4170/</description><pubDate>13 Mar 2026 23:20 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mgy2imyvxk26</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mgptdsoei22x</link><description>Given reports that Americans buy SUVs in part because the other cars on the road are big, it surprised me that &#34;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.&#34;&#xA;https://www.bloomberg.com/news/articles/2026-03-10/how-deadly-are-us-roads-it-depends-on-how-you-count-traffic-fatalities</description><pubDate>10 Mar 2026 16:51 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mgptdsoei22x</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mgliehsvgs22</link><description>The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n&gt;=1) with exactly k parts (k&gt;=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.&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>08 Mar 2026 23:24 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mgliehsvgs22</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mgdgyaqjas2t</link><description>Check out @fdecomite.bsky.social’s  incredible shelf based on Squaring the Square!&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>05 Mar 2026 18:38 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mgdgyaqjas2t</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mfu4uycct22p</link><description>Inspired by @robinhouston.mathstodon.xyz.ap.brid.gy&#39;s G4G16 gift of tetragonal disphenoidal blocks, I&#39;ve made some magnetized versions, which are satisfyingly click-y!&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>27 Feb 2026 16:27 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mfu4uycct22p</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mfnsbtd6os2k</link><description>Triangle read by rows: T(n,k) = number of step shifted (decimated) sequence structures of length n using exactly k different symbols.&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>25 Feb 2026 04:01 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mfnsbtd6os2k</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mfhuxw64vk26</link><description>I wrote a blog post about my G4G16 gift. If you want a copy of your own, download and print the files!&#xA;https://peterkagey.com/blog/2026/02/G4G16/</description><pubDate>22 Feb 2026 19:33 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mfhuxw64vk26</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mcfram2d2k2f</link><description>Three podcasts that I loved that have since stopped releasing new episodes, but which I wish more people knew about.&#xA;&#xA;– Hakai Magazine Audio Edition&#xA;– Ox Tales (by the Oxford Symposium on Food and Cookery)&#xA;– 70 Over 70 (by Pineapple Street Studios)&#xA;&#xA;Please recommend defunct podcasts to me too!</description><pubDate>14 Jan 2026 19:06 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mcfram2d2k2f</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3mayysaqmu22r</link><description>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.&#xA;https://peterkagey.com/blog/2025/12/potato_printing/</description><pubDate>27 Dec 2025 23:51 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3mayysaqmu22r</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3m7q7ifva3c2r</link><description>Don Knuth just published OEIS sequence: &#xA;&#34;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.&#34;&#xA;&#xA;It references three sequences, two of which are sequences I published in 2019!&#xA;https://oeis.org/A391478</description><pubDate>11 Dec 2025 18:32 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3m7q7ifva3c2r</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3m6mtuqcugk2y</link><description>I wrote a blog post about human polyhedra, which truly *embodies* mathematics.&#xA;https://peterkagey.com/blog/2025/11/human_rd/</description><pubDate>27 Nov 2025 17:01 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3m6mtuqcugk2y</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3m5smg55ju227</link><description>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.&#xA;&#xA;This last week, I&#39;ve updated it to make it more mobile-friendly and colorful! Try it out and see if you can improve any of the bounds!&#xA;https://peterkagey.com/apps/square_game/</description><pubDate>17 Nov 2025 06:38 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3m5smg55ju227</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3m5hyr5wzok2c</link><description>Check out my new blog post on a prototype shelf that I designed and made out of cardboard based on the &#34;squaring the square&#34; problem, which asks if you can partition a square into smaller squares all of different sizes. (You can!)&#xA;&#xA;Come for the photos, stay for the 3D model!&#xA;https://peterkagey.com/blog/2025/11/squaring_the_shelf/</description><pubDate>13 Nov 2025 01:20 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3m5hyr5wzok2c</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3m5fc2fdrns27</link><description>I got a shoutout in the 245th edition of Carnival of Mathematics!&#xA;https://www.theoremoftheday.org/SpecialEvents/CoM245.html</description><pubDate>11 Nov 2025 23:28 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3m5fc2fdrns27</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3m4w3jaatm22d</link><description>Looks like #plotparty postcards have landed in mailboxes! Read my new blog post about the cards I designed.&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>05 Nov 2025 22:21 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3m4w3jaatm22d</guid></item><item><link>https://bsky.app/profile/peterkagey.com/post/3m47w5yiick2v</link><description>Triangle T(m,n) giving of number of steps in the Euclidean algorithm for gcd(m,n) with 0&lt;=m&lt;n.&#xA;&#xA;[contains quote post or other embedded content]</description><pubDate>28 Oct 2025 02:47 +0000</pubDate><guid isPermaLink="false">at://did:plc:6iqekgdgrt7o3hc5rwouj2de/app.bsky.feed.post/3m47w5yiick2v</guid></item></channel></rss>