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!)
A211004 Number of distinct regions in the set of partitions of n. 0
1, 2, 3, 5, 7, 9, 12, 15, 18, 22, 26, 30, 35, 40, 45, 51 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The number of regions in the set of partitions of n equals the number of partitions of n. The sequence counts only the distinct regions. For the definition of "regions of the set of partitions of n" (or more simply "regions of n") see A206437.
Is this the same as A001840 for all positive integers? If not, where is the first place these sequences differ?
LINKS
EXAMPLE
For n = 6 the 11 regions of 6 are [1], [2,1], [3,1,1], [2], [4,2,1,1,1], [3], [5,2,1,1,1,1,1], [2], [4,2], [3], [6,3,2,2,1,1,1,1,1,1,1]. These number are the first A006128(6) terms of triangle A206437 in which the first A000041(6) rows are the 11 regions of 6. We can see that the 8th region is equal to the 4th region: [2] = [2]. Also the 10th region is equal to the 6th region: [3] = [3]. There are two repeated regions, therefore a(6) = A000041(6) - 2 = 11 - 2 = 9.
CROSSREFS
Sequence in context: A184017 A024195 A071423 * A062781 A145919 A058937
KEYWORD
nonn,more
AUTHOR
Omar E. Pol, Oct 22 2012
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 April 25 09:38 EDT 2024. Contains 371967 sequences. (Running on oeis4.)