A grocer stacks oranges in a square pyramid. each orange sits on the 4 oranges below it. so, the top layer has 1 orange and the layer below it has 4 oranges. the layer below that has 9 oranges. the total number of oranges required for 1 layer is 1. the total number of oranges required for 2 layers is 5. the total number of oranges required for three layers is 14.

a. write a recursive formula for the sequence.

b. how many oranges are required for 10 layers?

Question

Kamron Gilmore

16 August, 13:16

+4

Answers (1)

Know the Answer?

Rubi Ayala · Answer 1

A. No. of oranges in layer no. i = i*i

b. No oranges reqired for 10 layers = ∑i² where i=0 and i-->10

= 385