|
|
A159666
|
|
a(n) = Sum_{k=1..n} binomial(n,k) * gcd(n,k) * a(k-1), with a(0) = 1.
|
|
2
|
|
|
1, 1, 4, 18, 104, 665, 5430, 45647, 457008, 4903380, 58782190, 735362309, 10577094600, 153445432699, 2462688382448, 41517435884340, 752130797186176, 13961847566945787, 284698729314200574, 5855054339061479491
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
a(n) is divisible by n for all n >= 1.
|
|
LINKS
|
|
|
MATHEMATICA
|
a[n_]:= a[n] = If[n==0, 1, Sum[Binomial[n, k] GCD[n, k] a[k-1], {k, n}]];
|
|
PROG
|
(SageMath)
def a(n): return 1 if (n==0) else sum(binomial(n, j)*gcd(n, j)*a(j-1) for j in range(1, n+1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|