The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127704 A054525 * A127701. 2

%I

%S 1,0,2,-1,1,3,-1,-2,1,4,-1,0,0,1,5,0,-3,-3,0,1,6,-1,0,0,0,0,1,7,0,0,

%T -1,-4,0,0,1,8,0,-1,-3,0,0,0,0,1,9,0,-2,0,-1,-5,0,0,0,1,10,-1,0,0,0,0,

%U 0,0,0,0,1,11,1,2,-1,-4,-1,-6,0,0,0,0,1,12,-1,0,0,0,0,0,0,0,0,0,0,1,13,0,-2

%N A054525 * A127701.

%C Moebius transform of A127701.

%C Row sums = A127705: (1, 2, 3, 2, 5, 1, 7, 4, 6, 3, ...)

%H Robert Israel, <a href="/A127704/b127704.txt">Table of n, a(n) for n = 1..10011</a> (rows 1 to 141, flattened)

%e First few rows of the triangle are:

%e 1;

%e 0, 2;

%e -1, 1, 3;

%e -1, -2, 1, 4;

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

%e 0, -3, -3, 0, 1, 6;

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

%e ...

%p A054525 := proc(n,k) if n>=1 and 1<=k and k <= n then if n mod k = 0 then numtheory[mobius](n/k) ; else 0 ; fi; else 0 ; fi; end: A127701 := proc(n,k) if n<1 or k<1 or k > n then 0 ; elif n = k then n; elif k+ 1 =n then 1; else 0 ; fi; end: A127704 := proc(n,k) add( A054525(n,i)*A127701(i,k),i=1..n) ; end: for n from 1 to 30 do for k from 1 to n do printf("%d,",A127704(n,k)) ; od: od: # _R. J. Mathar_, Jul 21 2009

%Y Cf. A054525, A127701, A127705.

%K tabl,easy,sign

%O 1,3

%A _Gary W. Adamson_, Jan 24 2007

%E More terms from _R. J. Mathar_, Jul 21 2009

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

Last modified September 21 10:03 EDT 2020. Contains 337268 sequences. (Running on oeis4.)