Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127505
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127505 Triangle, left column = mu(n), right border = phi(n). +0
1
1, -1, 1, -1, 0, 2, 0, -1, 0, 2, -1, 0, 0, 0, 4, 1, -1, -2, 0, 0, 2, -1, 0, 0, 0, 0, 0, 6, 0, 0, 0, -2, 0, 0, 0, 4, 0, 0, -2, 0, 0, 0, 0, 0, 6, 1, -1, 0, 0, -4, 0, 0, 0, 0, 4 (list; table; graph; listen)
OFFSET

1,6

COMMENT

Left column = mu(n), A008683; right border = phi(n), A000010; row sums = A007431: (1, 0, 1, 1, 3, 0, 5,...).

FORMULA

Mobius transform of M, where M = an infinite lower triangular matrix with phi(n) in the main diagonal and the rest zeros.

EXAMPLE

First few rows of the triangle are:

1;

-1, 1;

-1, 0, 2;

0, -1, 0, 2;

-1, 0, 0, 0, 4;

1, -1, -2, 0, 0, 2;

...

CROSSREFS

Cf. A051731, A000010, A007431.

Sequence in context: A158945 A156667 A110914 this_sequence A138036 A086372 A089650

Adjacent sequences: A127502 A127503 A127504 this_sequence A127506 A127507 A127508

KEYWORD

tabl,uned,sign

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Jan 17 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research