I worked a bit on some ideas for a 2021 , raiding the Online Encyclopedia of Integer Sequences for inspiration.

Implemented the basic algorithm of one so far: the sum of all the parts of all the partitions of 43 into 9 primes is 2021. (There are 47 partitions, 2021 is the product of two adjacent 43 * 47). Making it prettier is a task for later.

· · Web · · ·

Number of partitions of n into distinct parts >= 4. a(61) = 2021; pictured: a(36) = 120

Number of partitions of n into distinct parts >= 4; pictured: a(47) = 447.

No gaps this time. Scanlines are doubled to get a better aspect ratio.

Will probably try to do the full a(61) = 2021 as high resolution (vector) graphics for the final image, these textures are starting to look pretty nice

Number of partitions of n into distinct parts >= 4; a(61) = 2021. PPM export rendered as a byte string. Not sure about the colour scheme. This one is stretched vertically more at the top (small parts) than the bottom (big parts) for aesthetic reasons.

Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 1, 1), (1, 0, -1), (1, 0, 1)}.
a(6) = 2021 Welcome to post.lurk.org, an instance for discussions around cultural freedom, experimental, new media art, net and computational culture, and things like that.