|
Search: id:A140207
|
|
|
| A140207 |
|
Triangle read by rows in which row n (n>=0) gives the first n terms of A000041. |
|
+0
5
|
|
| 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 3, 5, 1, 1, 2, 3, 5, 7, 1, 1, 2, 3, 5, 7, 11, 1, 1, 2, 3, 5, 7, 11, 15, 1, 1, 2, 3, 5, 7, 11, 15, 22, 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 1, 1, 2, 3, 5, 7, 11, 15, 22
(list; table; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
Number of partitions of n into distinct parts with maximal size, see A000009. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 13 2009]
|
|
REFERENCES
|
Aicardi Francesca, Matricial formulae for partitions, arXiv:0806.1273. [Note that there is an error in the triangle given there.]
|
|
EXAMPLE
|
Triangle begins:
1
1,1
1,1,2
1,1,2,3
1,1,2,3,5
1,1,2,3,5,7
1,1,2,3,5,7,11
1,1,2,3,5,7,11,15
1,1,2,3,5,7,11,15,22
1,1,2,3,5,7,11,15,22,30
1,1,2,3,5,7,11,15,22,30,42
1,1,2,3,5,7,11,15,22,30,42,56
1,1,2,3,5,7,11,15,22,30,42,56,77
1,1,2,3,5,7,11,15,22,30,42,56,77,101
|
|
CROSSREFS
|
Sequence in context: A124769 A128227 A144328 this_sequence A104763 A027751 A004070
Adjacent sequences: A140204 A140205 A140206 this_sequence A140208 A140209 A140210
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jun 10 2008, based on a suggestion from Gary Adamson.
|
|
|
Search completed in 0.002 seconds
|
