|
|
A258651
|
|
A(n,k) = n^(k) = k-th arithmetic derivative of n; square array A(n,k), n>=0, k>=0, read by antidiagonals.
|
|
17
|
|
|
0, 0, 1, 0, 0, 2, 0, 0, 1, 3, 0, 0, 0, 1, 4, 0, 0, 0, 0, 4, 5, 0, 0, 0, 0, 4, 1, 6, 0, 0, 0, 0, 4, 0, 5, 7, 0, 0, 0, 0, 4, 0, 1, 1, 8, 0, 0, 0, 0, 4, 0, 0, 0, 12, 9, 0, 0, 0, 0, 4, 0, 0, 0, 16, 6, 10, 0, 0, 0, 0, 4, 0, 0, 0, 32, 5, 7, 11, 0, 0, 0, 0, 4, 0, 0, 0, 80, 1, 1, 1, 12
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Square array A(n,k) begins:
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
2, 1, 0, 0, 0, 0, 0, 0, 0, 0, ...
3, 1, 0, 0, 0, 0, 0, 0, 0, 0, ...
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, ...
5, 1, 0, 0, 0, 0, 0, 0, 0, 0, ...
6, 5, 1, 0, 0, 0, 0, 0, 0, 0, ...
7, 1, 0, 0, 0, 0, 0, 0, 0, 0, ...
8, 12, 16, 32, 80, 176, 368, 752, 1520, 3424, ...
9, 6, 5, 1, 0, 0, 0, 0, 0, 0, ...
|
|
MAPLE
|
d:= n-> n*add(i[2]/i[1], i=ifactors(n)[2]):
A:= proc(n, k) option remember; `if`(k=0, n, d(A(n, k-1))) end:
seq(seq(A(n, h-n), n=0..h), h=0..14);
|
|
MATHEMATICA
|
d[n_] := n*Sum[i[[2]]/i[[1]], {i, FactorInteger[n]}]; d[0] = d[1] = 0;
A[n_, k_] := A[n, k] = If[k == 0, n, d[A[n, k-1]]];
Table[A[n, h-n], {h, 0, 14}, {n, 0, h}] // Flatten (* Jean-François Alcover, Apr 27 2017, translated from Maple *)
|
|
CROSSREFS
|
Columns k=0-10 give: A001477, A003415, A068346, A099306, A258644, A258645, A258646, A258647, A258648, A258649, A258650.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|