|
|
|
|
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, 48, 8, 8, 1, 9, 72, 72, 108, 108, 72, 72, 9, 1, 10, 90, 720, 180, 1080, 180, 720, 90, 10, 1, 1, 10, 90, 180, 180, 180, 180, 90, 10, 1, 1, 12, 12, 120, 270, 2160, 360, 2160, 270, 120, 12, 12, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Triangle begins as:
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, 48, 8, 8, 1;
9, 72, 72, 108, 108, 72, 72, 9, 1;
|
|
MATHEMATICA
|
f[n_]:= If[PrimeQ[n], 1, n];
cf[n_]:= cf[n]= If[n==0, 1, f[n]*cf[n-1]]; (* A049614 *)
T[n_, k_]:= T[n, k]= cf[n]/(cf[k]*cf[n-k]);
Table[T[n, k], {n, 12}, {k, n}]//Flatten
|
|
PROG
|
(PARI) primorial(n)=prod(i=1, primepi(n), prime(i))
(Magma)
A049614:= func< n | n le 1 select 1 else Factorial(n)/(&*[NthPrime(j): j in [1..#PrimesUpTo(n)]]) >;
(SageMath)
def A049614(n): return factorial(n)/product(nth_prime(j) for j in range(1, 1+prime_pi(n)))
flatten([[A117683(n, k) for k in range(1, n+1)] for n in range(1, 13)]) # G. C. Greubel, Jul 21 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Edited by the Associate Editors of the OEIS, Aug 18 2009
|
|
STATUS
|
approved
|
|
|
|