|
Search: id:A135299
|
|
|
| A135299 |
|
Pascal's triangle, but the last element of the row is the sum of the all the previous terms. |
|
+0
1
|
|
| 1, 1, 2, 1, 3, 8, 1, 4, 11, 32, 1, 5, 15, 43, 128, 1, 6, 20, 58, 171, 512, 1, 7, 26, 78, 229, 683, 2048, 1, 8, 33, 104, 307, 912, 2731, 8192, 1, 9, 41, 137, 411, 1219, 3643, 10923, 32768, 1, 10, 50, 178, 548, 1630, 4862, 14566, 43691, 131072
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
T(n,n)=(4^n)/2 n>0 T(n,n)=2 sum([i=0 to n-1] T(n,i))
|
|
FORMULA
|
T(0,0)=1 T(n,k)=T(n-1,k-1)+T(n-1,k) if k<n T(n,n)=sum([j=0 to n-1](sum([i=0 to j]T(j,i)))+sum([i=0 to n-1]T(n,i)) <<i.e sum of the all terms of the triangle>>
|
|
EXAMPLE
|
T(2,1)=T(1,0)+T(1,1)=1+2=3
T(2,2)=T(0,0)+T(1,0)+T(1,1)+T(2,0)+T(2,1)=1+1+2+1+3=8
|
|
CROSSREFS
|
Cf. A067337, A007318.
Adjacent sequences: A135296 A135297 A135298 this_sequence A135300 A135301 A135302
Sequence in context: A010758 A019224 A053190 this_sequence A092081 A057740 A137307
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Jose Ramon Real (joseramonreal(AT)yahoo.es), Dec 04 2007
|
|
|
Search completed in 0.002 seconds
|
