Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,7

COMMENT

t(n,k+1)<=t(n,k)<=t(n+1,k); t(n,k)>1 iff 0<=2*k+1<n.

LINKS

Eric Weisstein's World of Mathematics, Partition Function Q.

Reinhard Zumkeller, Notes on initial terms

FORMULA

t(n, k) = 1 + Sum(t(i, j): i>j>k and i+j=n), 0<=k<=n.

CROSSREFS

A000009(n)=t(n, 0), left border of the triangle, A025147(n)=t(n, 1) for n>1.

Sequence in context: A143898 A101873 A146289 this_sequence A081418 A088951 A107453

Adjacent sequences: A079208 A079209 A079210 this_sequence A079212 A079213 A079214

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 01 2003

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research