I'm looking for a code, to calculate the number of k-regular Partitions, of a positiv integer n. A k-regular Partition is a Partition, in which no summand is a multiple of k.
Hopefully someone has an idea! I am using the online Version of SageMath.
You can use the standard Paritions() functionality by specifying allowed parts as not multiples of k below n:
def k_regular_partitions(n,k):
return Partitions(n,parts_in=[i for i in range(1,n+1) if i%k]).cardinality()Asked: 1 year ago
Seen: 145 times
Last updated: Dec 26 '23
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.