login
A176891
Triangle T(n,k) = k if k<n and k|n, = 0 otherwise, 1 <= k <= n; read by rows.
3
1, 1, 0, 1, 0, 0, 1, 2, 0, 0, 1, 0, 0, 0, 0, 1, 2, 3, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 2, 0, 4, 0, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 5, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 0, 6, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0
OFFSET
1,8
COMMENTS
A variant of A127093, which has T(n,n) = n. [The original definition said "Subsequence of A127093". Since all nonnegative integers are repeated infinitely often in both sequences, each one is a subsequence of the other, but there is no such relation on a row-by-row basis. - M. F. Hasler, Aug 08 2016]
Let A=A176891*A176891, B=A*A, C=B*B, D=C*C and so on, then the leftmost column in the last matrix (D) converges to A165552.
FORMULA
T(n,k) = if n=1 and k=1 then 1 elseif n=k then 0 elseif k divides n then k else 0.
EXAMPLE
Triangle begins:
1,
1,0,
1,0,0,
1,2,0,0,
1,0,0,0,0,
1,2,3,0,0,0,
1,0,0,0,0,0,0,
1,2,0,4,0,0,0,0,
CROSSREFS
Sequence in context: A216279 A025441 A286813 * A219486 A284574 A206499
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson and Mats Granvik, Apr 28 2010
EXTENSIONS
Definition corrected by M. F. Hasler, Aug 08 2016
STATUS
approved