1,2

At the first step, we put a single square on the row 1.For the second we put a square above the first one on the row 2 and a square on each of its sides on row. At each following step, we begin a new raw with one square and add a square at each end of all the previous rows. The term c(n) of the sequence is the total number of squares of any size which can be read in the pyramid.

..........................__

..........__...........__|__|__..

.__....__|__|__.....__|__|__|__|__

|__|..|__|__|__|...|__|__|__|__|__|

The 46 first terms of the sequence are exactly the same than those published in A092498 under a much more complex definition.However it's tempting to suspect a duplicate but I don't have the least idea of how to try to prove it.

In the above array, the first column refers to the height n of the pyramid described on the same row, the following ones to the size of the squares present in tne concerned pyramid and the last column gives c(n), total of the line

1 | .1......................1

2 | .4......................4

3 | .9...2.................11

4 | 16...6...1.............23

5 | 25..12...4.............41

6 | 36..20...9...2.........67

If n is of the form 3*p c(n) = n*(4*n^2+9*n+3)/18

If n is of the form 3*p+1 c(n) = (n+2)*(4*n^2+n+1)/18

If n is of the form 3*p+2 c(n) = (n+1)*(4*n^2+5*n-2)/18

For n = 3 there are (5+3+1)=9 squares of size 1 on row 1,2 and 3 and 2 squares of size 2 laying on the floor 1, hence c(3)=11

Cf. A092498.

Sequence in context: A009907 A027378 A092498 this_sequence A019298 A014242 A008181

Adjacent sequences: A131174 A131175 A131176 this_sequence A131178 A131179 A131180

easy,nonn

Philippe LALLOUET (philip.lallouet(AT)wanadoo.fr), Sep 24 2007