Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143255
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143255 Triangle read by rows, A128407 * A126988; 1<=k<=n. +0
2
1, -2, -1, -3, 0, -1, 0, 0, 0, 0, -5, 0, 0, 0, -1, 6, 3, 2, 0, 0, 1, -7, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 10, 5, 0, 0, 2, 0, 0, 0, 0, 1, -11, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -13, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 14, 7, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 1 (list; table; graph; listen)
OFFSET

1,2

COMMENT

Left border = A055615: (1, -2, -3, 0, -5, 6, -7,...).

Right border = A008683, mu(n).

Row sums = A063441: (1, -3, -4, 0, -6, 12, 8,...).

FORMULA

Triangle read by rows, A128407 * A126988; 1<=k<=n

t(n,m)=MoebiusMu[n]*A126988(n,m); t(n,m)=MoebiusMu[n]*If[m == 1, n, If[Mod[n, m] == 0, n/m, 0]]. - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 06 2008

EXAMPLE

First few rows of the triangle =

1;

-2, -1;

-3, 0, -1;

0, 0, 0, 0;

-5, 0, 0, 0, -1;

6, 3, 2, 0, 0, 1;

-7, 0, 0, 0, 0, 0, -1;

0, 0, 0, 0, 0, 0, 0, 0;

0, 0, 0, 0, 0, 0, 0, 0, 0;

10, 5, 0, 0, 2, 0, 0, 0, 0, 1;

...

MATHEMATICA

t[n_, m_] = MoebiusMu[n]*If[m == 1, n, If[Mod[n, m] == 0, n/m, 0]]; Table[Table[t[n, m], {m, 1, n}], {n, 1, 10}]; Flatten[%] - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 06 2008

CROSSREFS

Cf. A008683, A063441, A055615, A128407, A126988.

Cf. A128988.

Sequence in context: A010249 A002431 A062963 this_sequence A127139 A166139 A157929

Adjacent sequences: A143252 A143253 A143254 this_sequence A143256 A143257 A143258

KEYWORD

tabl,sign

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 02 2008

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 December 2 11:49 EST 2009. Contains 167811 sequences.


AT&T Labs Research