login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A234092 Limit of v(m,n) as m->oo, where v(m,n) is the number of distinct terms in the n-th partition of m in Mathematica (lexicographic) ordering of the partitions of m. 0
1, 2, 2, 2, 2, 3, 2, 2, 3, 2, 3, 2, 2, 3, 3, 3, 3, 3, 2, 2, 3, 3, 3, 2, 4, 3, 2, 3, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 4, 3, 2, 4, 3, 4, 3, 3, 3, 4, 4, 3, 2, 3, 3, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 4, 3, 4, 3, 3, 4, 4, 4, 4, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Limiting row of A115623.
LINKS
EXAMPLE
In Mathematica ordering, the 9th partition of n >= 8 is [n-4,3,1]. Thus, v(n,9) = 3 for n all n >= 8, so a(n) = 3.
MATHEMATICA
Table[Length[Union[IntegerPartitions[40][[k]]]], {k, 1, 150}]
CROSSREFS
Cf. A115623.
Sequence in context: A220431 A351284 A268317 * A047931 A258571 A033618
KEYWORD
nonn
AUTHOR
Clark Kimberling, Dec 26 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 2 01:19 EDT 2023. Contains 363078 sequences. (Running on oeis4.)