|
%I #14 Jul 22 2023 12:12:07
%S 1,1,1,1,1,1,4,4,4,1,1,4,4,1,1,6,6,24,6,6,1,1,6,6,6,6,1,1,8,8,48,12,
%T 48,8,8,1,9,72,72,108,108,72,72,9,1,10,90,720,180,1080,180,720,90,10,
%U 1,1,10,90,180,180,180,180,90,10,1,1,12,12,120,270,2160,360,2160,270,120,12,12,1
%N Triangle T(n,k) = A049614(n)/(A049614(k)*A049614(n-k)), read by rows.
%H G. C. Greubel, <a href="/A117683/b117683.txt">Rows n = 1..50 of the triangle, flattened</a>
%F T(n,k) = A049614(n)/(A049614(k)*A049614(n-k)), for 1 <= k <= n, n >= 1.
%F Sum_{k=1..n} T(n, k) = A117684(n).
%e Triangle begins as:
%e 1;
%e 1, 1;
%e 1, 1, 1;
%e 4, 4, 4, 1;
%e 1, 4, 4, 1, 1;
%e 6, 6, 24, 6, 6, 1;
%e 1, 6, 6, 6, 6, 1, 1;
%e 8, 8, 48, 12, 48, 8, 8, 1;
%e 9, 72, 72, 108, 108, 72, 72, 9, 1;
%t f[n_]:= If[PrimeQ[n], 1, n];
%t cf[n_]:= cf[n]= If[n==0, 1, f[n]*cf[n-1]]; (* A049614 *)
%t T[n_, k_]:= T[n, k]= cf[n]/(cf[k]*cf[n-k]);
%t Table[T[n, k], {n,12}, {k,n}]//Flatten
%o (PARI) primorial(n)=prod(i=1,primepi(n),prime(i))
%o T(n,m)=binomial(n,m)*primorial(m)*primorial(n-m)/primorial(n) \\ _Charles R Greathouse IV_, Jan 16 2012
%o (Magma)
%o A049614:= func< n | n le 1 select 1 else Factorial(n)/(&*[NthPrime(j): j in [1..#PrimesUpTo(n)]]) >;
%o A117683:= func< n,k | A049614(n)/(A049614(k)*A049614(n-k)) >;
%o [A117683(n,k): k in [1..n], n in [1..12]]; // _G. C. Greubel_, Jul 21 2023
%o (SageMath)
%o def A049614(n): return factorial(n)/product(nth_prime(j) for j in range(1, 1+prime_pi(n)))
%o def A117683(n,k): return A049614(n)/(A049614(k)*A049614(n-k))
%o flatten([[A117683(n,k) for k in range(1,n+1)] for n in range(1,13)]) # _G. C. Greubel_, Jul 21 2023
%Y Cf. A049614, A117684.
%K nonn,tabl
%O 1,7
%A _Roger L. Bagula_, Apr 12 2006
%E Edited by the Associate Editors of the OEIS, Aug 18 2009
%E Edited by _G. C. Greubel_, Jul 21 2023
|
