cp's OEIS Frontend

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.

A129360 A054525 * A115361.

Original entry on oeis.org

1, 0, 1, -1, 0, 1, 0, 0, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
Offset: 1

Views

Author

Gary W. Adamson, Apr 10 2007

Keywords

Comments

Row sums = A209229 (1, 1, 0, 1, 0, 0, 0, 1, ...).
A129353 = the inverse Möbius transform of A115361.

Examples

			First few rows of the triangle are:
   1;
   0,  1;
  -1,  0,  1;
   0,  0,  0,  1;
  -1,  0,  0,  0,  1;
   0, -1,  0,  0,  0,  1;
  -1,  0,  0,  0,  0,  0,  1;
   0,  0,  0,  0,  0,  0,  0,  1;
  ...
		

Crossrefs

Column 1 is A087003 (Moebius transform of A209229).
Row sums are A209229.

Programs

  • PARI
    tabl(nn) = {Tm = matrix(nn, nn, n, k, if (! (n % k), moebius(n/k), 0)); Tr = matrix(nn, nn, n, k, n--; k--; if ((n==k), 1, if (n==2*k+1, -1, 0))); Ti = Tr^(-1); Tp = Tm*Ti; for (n=1, nn, for (k=1, n, print1(Tp[n, k], ", ");); print(););} \\ Michel Marcus, Mar 28 2015
    
  • PARI
    T(n, k)={ if(n%k, 0, sumdiv(n/k, d, my(e=valuation(d, 2)); if(d==1<Andrew Howroyd, Aug 03 2018

Formula

Moebius transform of A115361.
T(n,k) = A087003(n/k) for k | n, T(n,k) = 0 otherwise. - Andrew Howroyd, Aug 03 2018

Extensions

More terms from Michel Marcus, Mar 28 2015
Offset changed by Andrew Howroyd, Aug 03 2018