|
%I #12 Dec 07 2019 12:18:29
%S 1,1,0,1,1,0,1,0,0,0,1,2,1,0,0,1,0,0,0,0,0,1,1,0,1,0,0,0,1,0,1,0,0,0,
%T 0,0,1,3,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,2,1,0,1,0,0,0,0,0,1,0,
%U 0,0,0,0,0,0,0,0,0,0,1,2,0,0,0,0,1,0,0,0,0,0,0,1,0,1,0,1,0,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,1,0,0,0,0,0,0,0
%N Transpose of square array A286561.
%C See A286561 and A286563.
%H Antti Karttunen, <a href="/A286562/b286562.txt">Table of n, a(n) for n = 1..7875; the first 125 antidiagonals of array</a>
%e The top left 16 X 16 corner of the array:
%e n \ k
%e \ 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
%e .-----------------------------------------------
%e 1 | 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
%e 2 | 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4
%e 3 | 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 1, 0
%e 4 | 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2
%e 5 | 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0
%e 6 | 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0
%e 7 | 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0
%e 8 | 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1
%e 9 | 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0
%e 10 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0
%e 11 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0
%e 12 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0
%e 13 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0
%e 14 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0
%e 15 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0
%e 16 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
%e The array is read by descending antidiagonals.
%o (Scheme) (define (A286562 n) (A286561bi (A004736 n) (A002260 n))) ;; For A286561bi see A286561.
%o (Python)
%o def a(n, k):
%o i=1
%o if k==1: return 1
%o while n%(k**i)==0:
%o i+=1
%o return i-1
%o for n in range(1, 21): print [a(k, n - k + 1) for k in range(1, n + 1)][::-1] # _Indranil Ghosh_, May 20 2017
%Y Cf. A286561, A286563.
%K nonn,tabl
%O 1,12
%A _Antti Karttunen_, May 20 2017
|
