Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060016
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060016 Triangle T(n,k) = number of partitions of n into k distinct parts, 1<=k<=n. +0
9
1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 2, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 3, 1, 0, 0, 0, 0, 1, 3, 2, 0, 0, 0, 0, 0, 1, 4, 3, 0, 0, 0, 0, 0, 0, 1, 4, 4, 1, 0, 0, 0, 0, 0, 0, 1, 5, 5, 1, 0, 0, 0, 0, 0, 0, 0, 1, 5, 7, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 8, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 10, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; table; graph; listen)
OFFSET

1,12

COMMENT

Also number of partitions of n-k(k+1)/2 into at most k parts (not necessarily distinct).

A025147(n) = Sum(a(n-k+1,k-1): 1<k<=floor((n+2)/2). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 04 2007

REFERENCES

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 831.

L. Comtet, Advanced Combinatorics, Reidel, 1974, pp. 94, 96 and 307.

F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 219.

D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section XIV.2, p. 493.

LINKS

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].

FORMULA

T(n, k) =T(n-k, k)+T(n-k, k-1) [with T(n, 0)=1 if n=0 and 0 otherwise].

EXAMPLE

1; 1,0; 1,1,0; 1,1,0,0; 1,2,0,0,0; ...

T(8,3)=2 since 8 can be written in 2 ways as the sum of 3 distinct positive integers: 5+2+1 and 4+3+1.

CROSSREFS

Columns (offset) include A057427, A004526, A001399, A001400, A001401, etc. Cf. A000009 (row sums), A008289 (without zeros), A030699 (row maximum), A008284 (partition triangle including duplications).

See A008289 for another version.

Sequence in context: A025891 A120630 A089605 this_sequence A117408 A079100 A123262

Adjacent sequences: A060013 A060014 A060015 this_sequence A060017 A060018 A060019

KEYWORD

nonn,tabl,nice,easy

AUTHOR

njas

EXTENSIONS

More terms, recurrence, etc. from Henry Bottomley (se16(AT)btinternet.com), Mar 26 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research