Title

Euler-Type Partition Recurrences

Document Type

Presentation

Publication Date

10-8-2016

Abstract

Let p(n) denote the number of partitions of the integer n. Recall Euler’s recurrence p(n) - p(n-1) - p(n-2) + p(n-5) + p(n-7) - p(n-12) - p(n-15) + . . . = 0 for all nonzero n. We present some additional Euler-type recurrences for p(n) and other combinatorial functions. Joint work with Yuriy Choliy, Rutgers University.

Sponsorship/Conference/Institution

Integers Conference

Location

Carrollton, GA

Share

COinS