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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103994 A129360 * A115361. 3
1, 1, 1, -1, 0, 1, 1, 1, 0, 1, -1, 0, 0, 0, 1, -1, -1, 1, 0, 0, 1, -1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 1, -1, -1, 0, 0, 1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, -1, 0, 1, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Row sums = A104117: (1, 2, 0, 3, 0, 0, 0, 4, 0, 0,...).

LINKS

Table of n, a(n) for n=1..91.

FORMULA

A129360 * A115361 as infinite lower triangular matrices.

EXAMPLE

First few rows of the triangle are:

1;

1, 1;

-1, 0, 1;

1, 1, 0, 1;

-1, 0, 0, 0, 1;

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

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

1, 1, 0, 1, 0, 0, 0, 1;

...

PROG

(PARI) tabl(nn) = {Tm = matrix(nn, nn, n, k, if (! (n % k), moebius(n/k), 0)); Tr = matrix(nn, nn, n, k, n--; k--; if ((n==k), 1, if (n==2*k+1, -1, 0))); Ti = Tr^(-1); Tp = Tm*Ti*Ti; for (n=1, nn, for (k=1, n, print1(Tp[n, k], ", "); ); print(); ); }

CROSSREFS

Cf. A104117, A129360, A115361.

Sequence in context: A054524 A110471 A174854 * A051731 A135839 A071022

Adjacent sequences:  A103991 A103992 A103993 * A103995 A103996 A103997

KEYWORD

tabl,sign

AUTHOR

Gary W. Adamson, Apr 15 2007

EXTENSIONS

More terms from Michel Marcus, Mar 28 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 03:15 EST 2016. Contains 279034 sequences.