The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123706 Matrix inverse of triangle A010766, where A010766(n,k) = [n/k], for n>=k>=1. 9

%I #22 Apr 23 2017 01:03:12

%S 1,-2,1,-1,-1,1,1,-1,-1,1,-1,0,0,-1,1,2,0,-1,0,-1,1,-1,0,0,0,0,-1,1,0,

%T 0,1,-1,0,0,-1,1,0,1,-1,0,0,0,0,-1,1,2,-1,0,1,-1,0,0,0,-1,1,-1,0,0,0,

%U 0,0,0,0,0,-1,1,-1,1,1,-1,1,-1,0,0,0,0,-1,1,-1,0,0,0,0,0,0,0,0,0,0,-1,1,2,-1,0,0,0,1,-1,0,0,0,0,0,-1,1,1,1,-1,1,-1,0,0,0

%N Matrix inverse of triangle A010766, where A010766(n,k) = [n/k], for n>=k>=1.

%C Unsigned elements consist of only 0's, 1's and 2's.

%H Enrique Pérez Herrero, <a href="/A123706/b123706.txt">Rows n = 1..100 of triangle, flattened</a>

%F T(n,1) = +2 when n = 2*p where p is an odd prime.

%F T(n,1) = -2 when n is an even squarefree number with an odd number of prime divisors.

%F A123709(n) = number of nonzero terms in row n = 2^(m+1) - 1 when n is an odd number with exactly m distinct prime factors.

%F Sum_{k=1..n} T(n,k) = moebius(n).

%F Sum_{k=1..n} T(n,k)*k = 0 for n>1.

%F Sum_{k=1..n} T(n,k)*k^2 = 2*phi(n) for n>1 where phi(n)=A000010(n).

%F Sum_{k=1..n} T(n,k)*k^3 = 6*A102309(n) for n>1 where A102309(n)=Sum[d|n, moebius(d)*C(n/d,2) ].

%F Sum_{k=1..n} T(n,k)*k*2^(k-1) = A085411(n) = Sum_{d|n} mu(n/d)*(d+1)*2^(d-2) = total number of parts in all compositions of n into relatively prime parts.

%F T(n,k) = mu(n/k)-mu(n/(k+1)), where mu(n/k) is A008683(n/k) if k|n and 0 otherwise. - _Enrique Pérez Herrero_, Feb 21 2012

%e Triangle begins:

%e 1;

%e -2, 1;

%e -1,-1, 1;

%e 1,-1,-1, 1;

%e -1, 0, 0,-1, 1;

%e 2, 0,-1, 0,-1, 1;

%e -1, 0, 0, 0, 0,-1, 1;

%e 0, 0, 1,-1, 0, 0,-1, 1;

%e 0, 1,-1, 0, 0, 0, 0,-1, 1;

%e 2,-1, 0, 1,-1, 0, 0, 0,-1, 1;

%e -1, 0, 0, 0, 0, 0, 0, 0, 0,-1, 1;

%e -1, 1, 1,-1, 1,-1, 0, 0, 0, 0,-1, 1;

%e -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,-1, 1;

%e 2,-1, 0, 0, 0, 1,-1, 0, 0, 0, 0, 0,-1, 1;

%e 1, 1,-1, 1,-1, 0, 0, 0, 0, 0, 0, 0, 0,-1, 1; ...

%t t[n_, k_] := If[Divisible[n, k], MoebiusMu[n/k], 0] - If[Divisible[n, k+1], MoebiusMu[n/(k+1)], 0]; Table[t[n, k], {n, 1, 15}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Jun 29 2013, after _Enrique Pérez Herrero_ *)

%o (PARI) T(n,k)=(matrix(n,n,r,c,r\c)^-1)[n,k] \\ simplified by _M. F. Hasler_, Feb 12 2012

%Y Cf. A102309, A085411; A123707, A123708, A123709.

%K sign,tabl

%O 1,2

%A _Paul D. Hanna_, Oct 09 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 18:40 EDT 2024. Contains 372522 sequences. (Running on oeis4.)