Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A100529
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A100529
a(n) = minimal k such that n has a partition into k parts with the property that every number <= m can be partitioned into a subset of these parts.
+0
5
1, 1, 1, 1, 2, 1, 1, 3, 4, 3, 4, 2, 2, 1, 1, 12, 15, 13, 14, 11, 12, 9, 10, 6, 6, 4, 4, 2, 2, 1, 1, 84, 91, 82, 89, 77, 80, 70, 73, 60, 63, 53, 54, 43, 44, 35, 36, 26, 26, 20, 20, 14, 14, 10, 10, 6, 6, 4, 4, 2, 2, 1, 1, 908
(
list
;
graph
;
listen
)
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
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
