Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127511
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127511 mu(n) * 2^(n-1). +0
3
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 (list; graph; listen)
OFFSET

1,2

COMMENT

Row sums of A127512.

FORMULA

a(n)=A008683(n)*A000079(n-1). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 19 2007

EXAMPLE

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

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 (mathar(AT)strw.leidenuniv.nl), May 19 2007

CROSSREFS

Cf. A008683, A127512.

Sequence in context: A078022 A106603 A059057 this_sequence A009170 A009625 A055871

Adjacent sequences: A127508 A127509 A127510 this_sequence A127512 A127513 A127514

KEYWORD

sign,easy

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 17 2007

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 19 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research