|
|
A054521
|
|
Triangle read by rows: T(n,k) = 1 if gcd(n, k) = 1, T(n,k) = 0 otherwise (n >= 1, 1 <= k <= n).
|
|
59
|
|
|
1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The function T(n,k) = T(k,n) is defined for k > n but only the values for 1 <= k <= n as a triangular array are listed here.
T(n,k) = |K(n-k|k)| where K(i|j) is the Kronecker symbol. - Peter Luschny, Aug 05 2012
Twice the sum over the antidiagonals, starting with entry T(n-1,1), for n >= 3, is the same as the row n sum (i.e., phi(n): 2*Sum_{k=1..floor(n/2)} T(n-k,k) = phi(n), n >= 3). - Wolfdieter Lang, Apr 26 2013
The number of zeros in the n-th row of the triangle is cototient(n) = A051953(n). - Omar E. Pol, Apr 21 2017
This triangle is the j = 1 sub-triangle of A349221(n,k) = Sum_{j>=1} [k|binomial(n-1,k-1) AND gcd(n,k) = j], n >= 1, 1 <= k <= n, where [] is the Iverson bracket. - Richard L. Ollerton, Dec 14 2021
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The triangle T(n,k) begins:
n\k 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ...
1: 1
2: 1 0
3: 1 1 0
4: 1 0 1 0
5: 1 1 1 1 0
6: 1 0 0 0 1 0
7: 1 1 1 1 1 1 0
8: 1 0 1 0 1 0 1 0
9: 1 1 0 1 1 0 1 1 0
10: 1 0 1 0 0 0 1 0 1 0
11: 1 1 1 1 1 1 1 1 1 1 0
12: 1 0 0 0 1 0 1 0 0 0 1 0
13: 1 1 1 1 1 1 1 1 1 1 1 1 0
14: 1 0 1 0 1 0 0 0 1 0 1 0 1 0
15: 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0
Sums over antidiagonals: n = 3: 2*T(2,1) = 2 = T(3,1) + T(3,2) = phi(3). n = 4: 2*(T(3,1) + T(2,2)) = 2 = phi(4), etc. - Wolfdieter Lang, Apr 26 2013
|
|
MAPLE
|
A054521_row := n -> seq(abs(numtheory[jacobi](n-k, k)), k=1..n);
|
|
MATHEMATICA
|
T[ n_, k_] := Boole[ n>0 && k>0 && GCD[ n, k] == 1] (* Michael Somos, Jul 17 2011 *)
T[ n_, k_] := If[ n<1 || k<1, 0, If[ k>n, T[ k, n], If[ k==1, 1, If[ n>k, T[ k, Mod[ n, k, 1]], 0]]] (* Michael Somos, Jul 17 2011 *)
|
|
PROG
|
(PARI) {T(n, k) = n>0 && k>0 && gcd(n, k)==1} /* Michael Somos, Jul 17 2011 */
(Sage)
def A054521_row(n): return [abs(kronecker_symbol(n-k, k)) for k in (1..n)]
(Haskell)
a054521 n k = a054521_tabl !! (n-1) !! (k-1)
a054521_row n = a054521_tabl !! (n-1)
a054521_tabl = map (map a063524) a050873_tabl
a054521_list = concat a054521_tabl
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|