Revision History for A099961
(Underlined text is an addition;
strikethrough text is a deletion.)
Showing entries 1-10
| older changes
|
| |
|
| A099961
|
|
Triangle read by rows: Each row is constructed by forming the partial sums of the previous row, reading from the right and at every third row repeating the final term.
(history;
published version)
|
| |
|
|
#24 by N. J. A. Sloane at Tue Aug 03 19:05:00 EDT 2021
| |
| |
|
|
Discussion
|
| Tue Aug 03
| 19:05
| OEIS Server: https://oeis.org/edit/global/2906
|
| |
| |
|
|
#23 by N. J. A. Sloane at Tue Aug 03 19:03:19 EDT 2021
|
|
| AUTHOR
|
N. J. A. Sloane, Nov 13 2004, following a suggestion made by Douglas G. Rogers, Mar 10 2003
|
| |
|
|
Discussion
|
| Tue Aug 03
| 19:03
| OEIS Server: https://oeis.org/edit/global/2905
|
| |
| |
|
|
#22 by Joerg Arndt at Thu Aug 17 03:01:26 EDT 2017
| |
| |
| |
|
|
#21 by Michel Marcus at Thu Aug 17 01:36:58 EDT 2017
| |
| |
| |
|
|
#20 by Michel Marcus at Thu Aug 17 01:36:54 EDT 2017
|
|
| MAPLE
|
with(linalg):rev:=proc(a) local n, p; n:=vectdim(a): p:=i->a[n+1-i]: vector(n, p) end: ps:=proc(a) local n, q; n:=vectdim(a): q:=i->sum(a[j], j=1..i): vector(n, q) end: pss:=proc(a) local n, q; n:=vectdim(a): q:=proc(i) if i<=n then sum(a[j], j=1..i) else sum(a[j], j=1..n) fi end: vector(n+1, q) end: R[0]:=vector(1, 1): for n from 1 to 19 do if n mod 3 = 0 or n mod 3 = 1 then R[n]:=ps(rev(R[n-1])) else R[n]:=pss(rev(R[n-1])) fi od: for n from 0 to 19 do evalm(R[n]) od; # program yields the successive rows - _ # _Emeric Deutsch_, Nov 16 2004
|
|
| STATUS
|
proposed
editing
|
| |
| |
|
|
#19 by Jon E. Schoenfield at Thu Aug 17 01:17:47 EDT 2017
| |
| |
| |
|
|
#18 by Jon E. Schoenfield at Thu Aug 17 01:17:43 EDT 2017
|
|
| EXAMPLE
|
1;
1,
1 , 1;
1 , 2,
2 , 3,
3 , 5 , 5;
5 , 10 , 13,
13 , 23 , 28,
28 , 51 , 64 , 64;
|
|
| MAPLE
|
with(linalg):rev:=proc(a) local n, p; n:=vectdim(a): p:=i->a[n+1-i]: vector(n, p) end: ps:=proc(a) local n, q; n:=vectdim(a): q:=i->sum(a[j], j=1..i): vector(n, q) end: pss:=proc(a) local n, q; n:=vectdim(a): q:=proc(i) if i<=n then sum(a[j], j=1..i) else sum(a[j], j=1..n) fi end: vector(n+1, q) end: R[0]:=vector(1, 1): for n from 1 to 19 do if n mod 3 = 0 or n mod 3 = 1 then R[n]:=ps(rev(R[n-1])) else R[n]:=pss(rev(R[n-1])) fi od: for n from 0 to 19 do evalm(R[n]) od; # program yields the successive rows ( - _Emeric Deutsch)_, Nov 16 2004
|
|
| STATUS
|
approved
editing
|
| |
| |
|
|
#17 by Vaclav Kotesovec at Sat Dec 12 10:31:10 EST 2015
| |
| |
| |
|
|
#16 by Jon E. Schoenfield at Sat Dec 12 10:17:21 EST 2015
| |
| |
| |
|
|
#15 by Jon E. Schoenfield at Sat Dec 12 10:17:19 EST 2015
|
|
| EXAMPLE
|
1
1
1 1
1 2
2 3
3 5 5
5 10 13
13 23 28
28 51 64 64
|
|
| AUTHOR
|
N. J. A. Sloane, Nov 13 2004, following a suggestion made by Douglas G. Rogers, Mar 10, 2003
|
|
| STATUS
|
approved
editing
|
| |
| |
|
|
