login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219678 Number of tripartite partitions of (n,n,n) into triples. 3

%I #16 Mar 17 2015 18:49:19

%S 1,5,66,686,6721,58616,476781,3608348,25781989,174810494,1132328205,

%T 7037425172,42140788751,243918472743,1368647208107,7462686474948,

%U 39626100989332,205283558905562,1039263967957447,5149048724566723,24998922141116056,119073277412589351

%N Number of tripartite partitions of (n,n,n) into triples.

%C 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 Sean A. Irvine, <a href="/A219678/b219678.txt">Table of n, a(n) for n = 0..29</a>

%e 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 Column k=3 of A219727.

%Y Cf. A219560.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Nov 26 2012

%E More terms from _Sean A. Irvine_, Aug 14 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)