|
Search: id:A094727
|
|
|
| A094727 |
|
Triangle read by rows: T(n,k) = n + k, 0<=k<n. |
|
+0
4
|
|
| 1, 2, 3, 3, 4, 5, 4, 5, 6, 7, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 11, 7, 8, 9, 10, 11, 12, 13, 8, 9, 10, 11, 12, 13, 14, 15, 9, 10, 11, 12, 13, 14, 15, 16, 17, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
T(n+1,k) = T(n,k)+1 = T(n,k+1); T(n+1,k+1) = T(n,k)+2;
T(n,n-A005843(k))=A005843(n-k) for 0<=k<=n/2; T(n,n-A005408(k))=A005408(n-k) for 0<=k<n/2;
T(A005408(k),k) = A016777(k);
row sums give A000326;
all numbers m occur ceil(m/2) times, see A004526.
|
|
FORMULA
|
T(n,k) = A002024(n,k) + A002260(n,k) - 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 27 2006
T(m,n)=m+n+1 (m>=0, n>=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Jul 03 2009]
As a sequence rather than as a table: If m = floor((sqrt(8n-7)+1)/2), a(n) = n - m(m-3)/2 - 1 [From Carl R. White (oeisfan(AT)phodd.net), Jul 30 2009]
|
|
EXAMPLE
|
T(0,0)=1; T(0,1)=2; T(1,1)=3; T(3,2)=6; T(4,4)=9 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Jul 03 2009]
|
|
CROSSREFS
|
Cf. A004736, A094728.
Sequence in context: A120245 A120246 A120244 this_sequence A089308 A115729 A115728
Adjacent sequences: A094724 A094725 A094726 this_sequence A094728 A094729 A094730
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 24 2004
|
|
|
Search completed in 0.002 seconds
|
