cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A059901 Partitions encoded by prime factorization. The partition [P1+P2+P3+...] with P1>=P2>=P3>=... is encoded as 2^P1 * 3^P2 * 5^P3 *...

This page as a plain text file.
%I A059901 #7 Oct 18 2022 09:52:26
%S A059901 1,2,4,6,8,12,30,16,24,36,60,210,32,48,72,120,180,420,2310,64,96,144,
%T A059901 216,240,360,900,840,1260,4620,30030,128,192,288,432,480,720,1080,
%U A059901 1800,1680,2520,6300,9240,13860,60060,510510,256,384,576,864,1296,960,1440
%N A059901 Partitions encoded by prime factorization. The partition [P1+P2+P3+...] with P1>=P2>=P3>=... is encoded as 2^P1 * 3^P2 * 5^P3 *...
%C A059901 Partitions are ordered canonically (as described in the OEIS Wiki link): [] [1] [2] [1+1] [3] [2+1] [1+1+1] [4]... Rearrangement of A025487, A036035 etc.
%H A059901 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a059/A059901.java"></a> (github)
%H A059901 OEIS Wiki, <a href="/wiki/Partitions#Orderings_of_partitions">Orderings of partitions</a>
%F A059901 a(n) = A059900(A059902(n)).
%e A059901 Partition for n=17 is [2+2+1], so a(17)=2^2*3^2*5=180.
%Y A059901 Cf. A059902, A059900, A025487, A036035, A000041.
%K A059901 easy,nonn
%O A059901 0,2
%A A059901 _Marc LeBrun_, Feb 07 2001
%E A059901 Terms reordered by _Sean A. Irvine_, Oct 17 2022