The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129360 A054525 * A115361. 12
 1, 0, 1, -1, 0, 1, 0, 0, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, 0, 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 = A209229 (1, 1, 0, 1, 0, 0, 0, 1, ...). A129353 = the inverse MÃ¶bius transform of A115361. LINKS Andrew Howroyd, Table of n, a(n) for n = 1..1275 FORMULA Moebius transform of A115361. T(n,k) = A087003(n/k) for k | n, T(n,k) = 0 otherwise. - Andrew Howroyd, Aug 03 2018 EXAMPLE First few rows of the triangle are:    1;    0,  1;   -1,  0,  1;    0,  0,  0,  1;   -1,  0,  0,  0,  1;    0, -1,  0,  0,  0,  1;   -1,  0,  0,  0,  0,  0,  1;    0,  0,  0,  0,  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; for (n=1, nn, for (k=1, n, print1(Tp[n, k], ", "); ); print(); ); } \\ Michel Marcus, Mar 28 2015 (PARI) T(n, k)={ if(n%k, 0, sumdiv(n/k, d, my(e=valuation(d, 2)); if(d==1<

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

Last modified December 1 22:24 EST 2020. Contains 338858 sequences. (Running on oeis4.)