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.

Showing 1-1 of 1 results.

A127704 A054525 * A127701.

Original entry on oeis.org

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, -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, 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
Offset: 1

Views

Author

Gary W. Adamson, Jan 24 2007

Keywords

Comments

Moebius transform of A127701.
Row sums = A127705: (1, 2, 3, 2, 5, 1, 7, 4, 6, 3, ...)

Examples

			First few rows of the triangle are:
   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;
  ...
		

Crossrefs

Programs

  • Maple
    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

Extensions

More terms from R. J. Mathar, Jul 21 2009
Showing 1-1 of 1 results.