cp's OEIS Frontend

A219560 Number of tripartite partitions of (n,n,n) into distinct triples.

%I A219560 #21 Jan 15 2016 04:02:19
%S A219560 1,5,40,364,2897,21369,148257,970246,6032341,35850410,204646488,
%T A219560 1126463948,5999145787,30999381232,155798366059,763194776551,
%U A219560 3650648583934,17079277343463,78262895082681,351708874155894,1551843168854346
%N A219560 Number of tripartite partitions of (n,n,n) into distinct triples.
%C A219560 Number of factorizations of (p*q*r)^n into distinct factors where p, q, r are distinct primes.
%F A219560 a(n) = [(x*y*z)^n] 1/2 * Product_{i,j,k>=0} (1+x^i*y^j*z^k).
%e A219560 a(0) = 1: [].
%e A219560 a(1) = 5: [(1,1,1)], [(1,1,0),(0,0,1)], [(1,0,1),(0,1,0)], [(0,1,1),(1,0,0)], [(0,0,1),(0,1,0),(1,0,0)].
%p A219560 with(numtheory):
%p A219560 b:= proc(n, k) option remember;
%p A219560       `if`(n>k, 0, 1) +`if`(isprime(n), 0,
%p A219560       add(`if`(d>k, 0, b(n/d, d-1)), d=divisors(n) minus {1, n}))
%p A219560     end:
%p A219560 a:= n-> b(30^n$2):
%p A219560 seq(a(n), n=0..10);  # _Alois P. Heinz_, May 26 2013
%t A219560 b[n_, k_] := b[n, k] = If[n > k, 0, 1] + If[PrimeQ[n], 0, Sum[If[d > k, 0, b[n/d, d - 1]], {d, Divisors[n][[2 ;; -2]]}]]; a[0] = 1; a[n_] := b[30^n, 30^n];  Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 0, 20}] (* _Jean-François Alcover_, Jan 15 2016, after _Alois P. Heinz_ *)
%Y A219560 Column k=3 of A219585.
%Y A219560 Cf. A002774, A219554, A219561, A219565, A219678.
%K A219560 nonn,more
%O A219560 0,2
%A A219560 _Alois P. Heinz_, Nov 23 2012
%E A219560 a(16) from _Alois P. Heinz_, May 26 2013
%E A219560 a(17) from _Alois P. Heinz_, Sep 24 2014
%E A219560 More terms from _Jean-François Alcover_, Jan 15 2016