Congruence properties of binary partition functions
From MaRDI portal
Abstract: Let A be a finite subset of the natural numbers containing 0, and let f(n) denote the number of ways to write n in the form , where . We show that there exists a computable T = T(A) so that the sequence (f(n) mod 2) is periodic with period T. Variations and generalizations of this problem are also discussed.
Recommendations
Cites work
- Algebraic coding theory
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3289585 (Why is no real title available?)
- scientific article; zbMATH DE number 4187932 (Why is no real title available?)
- On m-ary partition function congruences: A fresh look at a past problem
- RECIPROCALS OF BINARY POWER SERIES
- Regularity properties of the Stern enumeration of the rationals
- The great trinomial hunt
Cited in
(17)- Generalization of the Rödseth-Gupta theorem on binary partitions
- On arithmetic properties of binary partition polynomials
- Odd behavior in the coefficients of reciprocals of binary power series
- The Euler binary partition function and subdivision schemes
- Periodicity of the parity of a partition function related to making change
- scientific article; zbMATH DE number 1185289 (Why is no real title available?)
- scientific article; zbMATH DE number 3475523 (Why is no real title available?)
- Newman cyclotomic polynomials, refinable splines and the Euler binary partition function
- On properties of the general bow sequence
- A non-standard ternary representation of integers
- Binary and semi-Fibonacci partitions
- Functions related to binary representation of integers
- Binary representations and theta function
- scientific article; zbMATH DE number 4187932 (Why is no real title available?)
- MC-finiteness of restricted set partition functions
- Values of binary partition function represented by a sum of three squares
- Non-standard quaternary representations and the Fibonacci numbers
This page was built for publication: Congruence properties of binary partition functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950418)