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!)
A130212 T(k, n) = sum_(1 <= j <= k) [j | k] j mu(k / j) floor(n / k), triangle read by rows. 4

%I #14 Jun 14 2019 21:49:07

%S 1,2,1,3,1,2,4,2,2,2,5,2,2,2,4,6,3,4,2,4,2,7,3,4,2,4,2,6,8,4,4,4,4,2,

%T 6,4,9,4,6,4,4,2,6,4,6,10,5,6,4,8,2,6,4,6,4,11,5,6,4,8,2,6,4,6,4,10,

%U 12,6,8,6,8,4,6,4,6,4,10,4,13,6,8,6,8,4,6,4,6,4,10,4,12

%N T(k, n) = sum_(1 <= j <= k) [j | k] j mu(k / j) floor(n / k), triangle read by rows.

%F A000012 * A054522 as infinite lower triangular matrices (previous name).

%F T(n,n) = A000010(n).

%e First few rows of the triangle are:

%e 1;

%e 2, 1;

%e 3, 1, 2;

%e 4, 2, 2, 2;

%e 5, 2, 2, 2, 4;

%e 6, 3, 4, 2, 4, 2;

%e 7, 3, 4, 2, 4, 2, 6;

%e 8, 4, 4, 4, 4, 2, 6, 4;

%e 9, 4, 6, 4, 4, 2, 6, 4, 6;

%e 10, 5, 6, 4, 8, 2, 6, 4, 6, 4;

%e ...

%p with(numtheory): A130212 := (n, k) -> add(j*mobius(k / j)*iquo(n, k), j = divisors(k)); # _Peter Luschny_, Oct 28 2010

%t A[n_, k_] := Sum[j MoebiusMu[k/j] Floor[n/k], {j, Divisors[k]}];

%t Table[A[n, k], {n, 1, 13}, {k, 1, n}] // Flatten (* _Jean-François Alcover_, Jun 14 2019 *)

%Y Cf. A000010, A130211 (product with swapped matrices), A054522, A000217 (row sums).

%K nonn,tabl,easy

%O 1,2

%A _Gary W. Adamson_, May 17 2007

%E Name replaced by new formula by _Peter Luschny_, Oct 28 2010

%E T(6,1) corrected by _R. J. Mathar_, Aug 06 2016

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 August 15 00:19 EDT 2024. Contains 375171 sequences. (Running on oeis4.)