The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124840 Triangle, row sums = A008683, the Mobius sequence. 1
1, 1, -2, 1, -4, 2, 1, -6, 6, -1, 1, -8, 12, -4, -2, 1, -10, 20, -10, -10, 10, 1, -12, 30, -20, -30, 60, -30, 1, -14, 42, -35, -70, 210, -210, 76, 1, -16, 46, -56, -140, 560, -840, 608, -173 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Cf. A124839, the inverse binomial transform of mu(n), A008683.
LINKS
FORMULA
Binomial transform of the diagonalized matrix using A124839; i.e., let A124839 (1, -2, 2, -1...) = the diagonal of an infinite matrix M; then the triangle (deleting the zeros) = P*M where P = Pascal's triangle as an infinite lower triangular matrix.
EXAMPLE
First few rows of the triangle are:
1;
1, -2;
1, -4, 2;
1, -6, 6, -1;
1, -8, 12, -4, -2
1, -10, 20, -10, -10, 10;
1, -12, 30, -20, -30, 60, -30;
...
E.g. mu(5) = -1 = sum of row 5 terms: (1 - 8 + 12 - 4 - 2).
CROSSREFS
Sequence in context: A128177 A087738 A133113 * A145118 A124927 A126279
KEYWORD
sign,tabl
AUTHOR
Gary W. Adamson, Nov 10 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 06:57 EDT 2024. Contains 372538 sequences. (Running on oeis4.)