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.
%I A219678 #16 Mar 17 2015 18:49:19 %S A219678 1,5,66,686,6721,58616,476781,3608348,25781989,174810494,1132328205, %T A219678 7037425172,42140788751,243918472743,1368647208107,7462686474948, %U A219678 39626100989332,205283558905562,1039263967957447,5149048724566723,24998922141116056,119073277412589351 %N A219678 Number of tripartite partitions of (n,n,n) into triples. %C A219678 a(n) is also the number of factorizations of m^n where m is a product of 3 distinct primes. a(1) = 5: (2*3*5)^1 = 30 has 5 factorizations: 30, 5*6, 3*10, 2*3*5, 2*15. %H A219678 Sean A. Irvine, <a href="/A219678/b219678.txt">Table of n, a(n) for n = 0..29</a> %e A219678 a(1) = 5: [(1,1,1)], [(1,1,0),(0,0,1)], [(1,0,1),(0,1,0)], [(1,0,0),(0,1,0),(0,0,1)], [(0,1,1),(1,0,0)]. %Y A219678 Column k=3 of A219727. %Y A219678 Cf. A219560. %K A219678 nonn %O A219678 0,2 %A A219678 _Alois P. Heinz_, Nov 26 2012 %E A219678 More terms from _Sean A. Irvine_, Aug 14 2014