login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127505 Triangle T(n,k) = mobius(n/k)*phi(k) if k|n, otherwise T(n,k)=0; 1<=k<=n. 0
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, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 1, 0, -2, 0, -2, 0, 0 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,6

FORMULA

T(n,k) = sum_{j=k..n} A054525(n,j)*A130207(j,k), 1<=k<=n.

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 (diagonal n=k), A007431 (row sums), A008683 (column k=1).

Sequence in context: A178090 A110914 A193527 * A194923 A086372 A089650

Adjacent sequences:  A127502 A127503 A127504 * A127506 A127507 A127508

KEYWORD

easy,tabl,sign

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 08:49 EST 2012. Contains 205740 sequences.