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.

A127511 a(n) = mu(n) * 2^(n-1).

Original entry on oeis.org

1, -2, -4, 0, -16, 32, -64, 0, 0, 512, -1024, 0, -4096, 8192, 16384, 0, -65536, 0, -262144, 0, 1048576, 2097152, -4194304, 0, 0, 33554432, 0, 0, -268435456, -536870912, -1073741824, 0, 4294967296, 8589934592, 17179869184, 0, -68719476736, 137438953472, 274877906944, 0, -1099511627776
Offset: 1

Views

Author

Gary W. Adamson, Jan 17 2007

Keywords

Comments

Row sums of A127512.
Appears to be the determinant of A156734 where the element in the lower right corner has been swapped with the element in the upper right corner. - Mats Granvik, Feb 14 2009

Examples

			a(5) = (-1)*16 = -16 since mu(5) = -1 and 2^4 = 16.
		

Crossrefs

Programs

  • Maple
    A127511 := proc(n) 2^(n-1)*numtheory[mobius](n) ; end: for n from 1 to 50 do printf("%d, ",A127511(n)) ; od ; # R. J. Mathar, May 19 2007
  • Mathematica
    Array[MoebiusMu[#]*2^(#-1)&,41] (* James C. McMahon, Jan 02 2025 *)

Formula

a(n)=A008683(n)*A000079(n-1). - R. J. Mathar, May 19 2007

Extensions

More terms from R. J. Mathar, May 19 2007