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!)
A281010 Triangle read by rows in which row 2n-1 lists the widths of the symmetric representation of sigma(n), and row 2n lists a finite sequence S together with -1, with the property that the partial sums of S give the row 2n-1. 6
1, 1, -1, 1, 1, 1, 1, 0, 0, -1, 1, 1, 0, 1, 1, 1, 0, -1, 1, 0, -1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, -1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, -1, 0, 0, 1, 0, 0, -1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, -1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, -1, 0, 0, 0, 0, 1, 0, 0, 0, -1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,61
COMMENTS
The row 2n-1 lists the widths of the terraces at the n-th level (starting from the top) of the pyramid described in A245092.
The sum of the areas of these terraces equals A000203(n): the sum of the divisors of n.
The k-th element of row 2n is associated to the k-th vertical cells at the n-th level of the pyramid.
The row 2n shows where the subparts (or subregions) of the terraces starting and ending, in accordance with the values 1 or -1.
The number of subparts in the n-th terrace equals A001227(n): the number of odd divisors of n.
If n is odd then the number of subparts in the n-th terrace is also A000005(n): the number of divisors of n.
LINKS
EXAMPLE
Triangle begins:
1;
1,-1;
1, 1, 1;
1, 0, 0,-1;
1, 1, 0, 1, 1;
1, 0,-1, 1, 0;-1;
1, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0, 0,-1;
1, 1, 1, 0, 0, 0, 1, 1, 1;
1, 0, 0,-1, 0, 0, 1, 0, 0,-1;
1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 1,-1, 0, 0, 0, 0,-1;
1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1;
1, 0, 0, 0,-1, 0, 0, 0, 0, 1, 0, 0, 0,-1;
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,-1;
1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0,-1, 0, 1, 0, 0,-1, 0, 1, 0, 0, 0, 0,-1;
1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0, 0, 0, 0,-1, 1, 0, 0, 0, 0, 0, 0, 0, 0,-1;
1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0,-1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0,-1;
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1;
1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0,-1, 0, 0, 0, 0, 0, 0, 0, 0,-1;
...
Written as an isosceles triangle the sequence begins:
.
. 1;
. 1, -1;
. 1, 1, 1;
. 1, 0, 0, -1;
. 1, 1, 0, 1, 1;
. 1, 0, -1, 1, 0, -1;
. 1, 1, 1, 1, 1, 1, 1;
. 1, 0, 0, 0, 0, 0, 0, -1;
. 1, 1, 1, 0, 0, 0, 1, 1, 1;
. 1, 0, 0, -1, 0, 0, 1, 0, 0, -1;
. 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1;
. 1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, -1;
. 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1;
. 1, 0, 0, 0, -1, 0, 0, 0, 0, 1, 0, 0, 0, -1;
. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1;
. 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1;
. 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1;
. 1, 0, 0, 0, 0, -1, 0, 1, 0, 0, -1, 0, 1, 0, 0, 0, 0, -1;
. 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1;
. 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1;
...
CROSSREFS
The sum of row 2n-1 is A000203(n).
The sum of row 2n is A000004(n) = 0.
The number of positive terms in row 2n is A001227(n).
The number of nonzero terms in row 2n is A054844(n).
Middle diagonal (or central column of the isosceles triangle) gives A067742.
Row 2n-1 is also the n-th row of A249351.
Row 2n is also the n-th row of A281011.
Row 2n-1 lists the partial sums of the terms, except the last term, of the row 2n.
Sequence in context: A330261 A157746 A349082 * A316864 A037820 A076493
KEYWORD
sign,tabl
AUTHOR
Omar E. Pol, Jan 12 2017
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 April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)