login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A262619
Number of parts in the symmetric representation of sigma(n) in two successive octants of two quadrants.
3
1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 3, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 5, 1, 3, 1, 1, 1, 3, 3, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 5, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 1, 3, 1, 1, 3, 5, 1, 1, 1, 1, 1, 3, 1
OFFSET
1,9
COMMENTS
In the diagram of the top view of the pyramid described in A244050 consider a 90-degree sector on two successive octants of two quadrants. The area of the top triangle is equal to 1 and the sum of the areas of all parts (or regions) added at n-th stage equals sigma(n), the sum of the divisors of n.
a(n) is also the number of terraces at n-th level (starting from the top) in the mentioned sector of the pyramid.
For more information see A237593 and A237270.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..5000 (computed from the b-file of A237271 provided by Michel Marcus)
FORMULA
a(n) = A237271(n), if A237271(n) is odd.
a(n) = A237271(n) - 1, if A237271(n) is even.
KEYWORD
nonn
AUTHOR
Omar E. Pol, Nov 06 2015
STATUS
approved