|
Search: id:A051162
|
|
|
| A051162 |
|
Triangle T(n,k) = n+k, n >= 0, 0<=k<=n. |
|
+0
8
|
|
| 0, 1, 2, 2, 3, 4, 3, 4, 5, 6, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 10, 11, 12, 7, 8, 9, 10, 11, 12, 13, 14, 8, 9, 10, 11, 12, 13, 14, 15, 16, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Row sums are A045943 = triangular matchstick numbers: 3n(n+1)/2. This was independently noted by myself and, without cross-reference, as a comment on A045943, by Jon Perry (perry(AT)globalnet.co.uk), Jan 15 2004. - Jonathan Vos Post (jvospost3(AT)gmail.com), Nov 09 2007
In partitions of n into distinct parts having maximal size, a(n) is the greatest number, see A000009. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 13 2009]
|
|
EXAMPLE
|
0; 1,2; 2,3,4; 3,4,5,6; 4,5,6,7,8; ...
|
|
CROSSREFS
|
Cf. A025581, A004736.
Cf. A025581, A004736, A045943.
Sequence in context: A063712 A106251 A134478 this_sequence A122872 A132919 A162619
Adjacent sequences: A051159 A051160 A051161 this_sequence A051163 A051164 A051165
|
|
KEYWORD
|
nonn,tabl,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
