Pascal's square pyramid read by slices, each slice being read by rows. Each entry in slice n is the sum of the 4 entries above it in slice n-1.
A086754
Pascal's square pyramid read by slices, each slice being read by rows. Each entry in slice n is the sum of the 4 entries above it in slice n-1.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =2a(7) =1a(8) =2a(9) =4a(10) =2a(11) =1a(12) =2a(13) =1a(14) =1a(15) =3a(16) =3a(17) =1a(18) =3a(19) =9a(20) =9a(21) =3a(22) =3a(23) =9a(24) =9a(25) =3a(26) =1a(27) =3a(28) =3a(29) =1
External references
- oeis: A086754