|
Search: id:A053732
|
|
|
| A053732 |
|
Number of ways to partition {1,...,n} into arithmetic progressions of length >= 1. |
|
+0
2
|
|
| 1, 2, 5, 13, 37, 111, 359, 1211, 4338, 16205, 63305, 254803, 1073370, 4638359
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(4) gives the total number of partitions of {1,2,3,4} (Bell(4); see A000110) excluding the partitions {1,2,4}{3} and {1,3,4}{2}. Hence a(4) = 15 - 2 = 13.
|
|
CROSSREFS
|
Cf. A000110.
Sequence in context: A126031 A114509 A003080 this_sequence A119495 A064384 A001475
Adjacent sequences: A053729 A053730 A053731 this_sequence A053733 A053734 A053735
|
|
KEYWORD
|
more,nonn,nice
|
|
AUTHOR
|
Marty Getz and Dixon Jones (ffmpg1(AT)uaf.edu, fndjj(AT)uaf.edu), Feb 13 2000
|
|
EXTENSIONS
|
More terms from Winston C. Yang (winston(AT)cs.wisc.edu), May 20 2001
|
|
|
Search completed in 0.002 seconds
|
