This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A127704 #11 Dec 30 2016 06:07:34 %S A127704 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 A127704 -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 A127704 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 A127704 A054525 * A127701. %C A127704 Moebius transform of A127701. %C A127704 Row sums = A127705: (1, 2, 3, 2, 5, 1, 7, 4, 6, 3, ...) %H A127704 Robert Israel, <a href="/A127704/b127704.txt">Table of n, a(n) for n = 1..10011</a> (rows 1 to 141, flattened) %e A127704 First few rows of the triangle are: %e A127704 1; %e A127704 0, 2; %e A127704 -1, 1, 3; %e A127704 -1, -2, 1, 4; %e A127704 -1, 0, 0, 1, 5; %e A127704 0, -3, -3, 0, 1, 6; %e A127704 -1, 0, 0, 0, 0, 1, 7; %e A127704 ... %p A127704 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 A127704 Cf. A054525, A127701, A127705. %K A127704 tabl,easy,sign %O A127704 1,3 %A A127704 _Gary W. Adamson_, Jan 24 2007 %E A127704 More terms from _R. J. Mathar_, Jul 21 2009