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!)
A182738 Partial sums of A066186. 11
1, 5, 14, 34, 69, 135, 240, 416, 686, 1106, 1722, 2646, 3959, 5849, 8489, 12185, 17234, 24164, 33474, 46014, 62646, 84690, 113555, 151355, 200305, 263641, 344911, 449015, 581400, 749520, 961622, 1228790, 1563509, 1982049 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) is also the volume of a three-dimensional version of the section model of partitions: the 3D illustrations in A135010 show boxes with face areas of 1 X 1, 2 X 2, 3 X 3, 4 X 5, 5 X 7 units along the m and p(m) axis, which is sequence A066186. Assuming that the boxes are 1 unit deep, the total volume of all boxes up to layer n is a(n). See the first two links.
From Omar E. Pol, Jan 20 2021: (Start)
a(n) is the sum of all parts of all partitions of all positive integers <= n.
Convolution of A000203 and A000070.
Convolution of A024916 and A000041.
Convolution of A175254 and A002865.
Convolution of A340793 and A014153.
Row sums of triangles A340527, A340531, A340579.
Consider a symmetric tower (a polycube) in which the terraces are the symmetric representation of sigma (n..1) respectively starting from the base (cf. A237270, A237593). The total area of the terraces equals A024916(n), the same as the area of the base.
The levels of the terraces starting from the base are the first n terms of A000070, that is A000070(0)..A000070(n-1), hence the differences between two successive levels give the partition numbers A000041, that is A000041(0)..A000041(n-1).
a(n) is the volume (or the total number of unit cubes) of the polycube.
That is due to the correspondence between divisors and partitions (cf. A336811).
The symmetric tower is a member of the family of the pyramid described in A245092.
The growth of the volume of the polycube represents every convolution mentioned above. (End)
LINKS
Omar E. Pol, Illustration of a(6) = 135, the polycube contains 135 unit cubes.
Omar E. Pol, Illustration of a(9) = 686, the polycube contains 686 unit cubes.
FORMULA
a(n) = n*A000070(n) - A014153(n-1). - Vaclav Kotesovec, Jun 23 2015
a(n) ~ sqrt(n) * exp(Pi*sqrt(2*n/3)) / (Pi*2^(3/2)) * (1 + (11*Pi/(24*sqrt(6)) - sqrt(6)/Pi)/sqrt(n) + (73*Pi^2/6912 - 3/16)/n). - Vaclav Kotesovec, Jun 23 2015, extended Nov 04 2016
G.f.: x*f'(x)/(1 - x), where f(x) = Product_{k>=1} 1/(1 - x^k). - Ilya Gutkovskiy, Apr 10 2017
EXAMPLE
a(6) = 135 because the volume V(6) = p(1) + 2*p(2) + 3*p(3) + 4*p(4) + 5*p(5) + 6*p(6) = 1 + 2*2 + 3*3 + 4*5 + 5*7 + 6*11 = 1 + 4 + 9 + 20 + 35 + 66 = 135 where p(n) = A000041(n).
MATHEMATICA
With[{no=35}, Accumulate[PartitionsP[Range[no]]Range[no]]] (* Harvey P. Dale, Feb 02 2011 *)
CROSSREFS
Sequence in context: A105082 A059821 A296010 * A192957 A094584 A023515
KEYWORD
nonn,easy
AUTHOR
Omar E. Pol, Jan 22 2011
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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)