Generating Functions for X(n) and Y(n)

This paper shows how to prove the Theorem , i.e., the number of partitions of n with no part repeated more than twice is equal to the number of partitions of n with no part is divisible by 3.

MoreLess

Year of publication:	2014-01-10
Authors:	Das, Sabuj ; Mohajan, Haradhan
Institutions:	Volkswirtschaftliche Fakultät, Ludwig-Maximilians-Universität München
Subject:	Infinite factors \| enumerated by X(n)

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	MPRA Paper.
Type of publication:	Book / Working Paper
Notes:	Published in American Review of Mathematics and Statistics 1.2(2014): pp. 41-43
Classification:	C02 - Mathematical Methods
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011110138