TY - JOUR

T1 - Congruences modulo high powers of 2 for sloane's box stacking function

AU - Rødseth, Øystein J.

AU - Sellers, James A.

PY - 2009/6/1

Y1 - 2009/6/1

N2 - We are given n boxes, labeled 1, 2,..., n. Box i weighs i grams and can support a total weight of i grams. The number of different ways to build a single stack of boxes in which no box will be squashed by the weight of the boxes above it is denoted by f(n). In a 2006 paper, the first author asked for "congruences for f(n) modulo high powers of 2". In this note, we accomplish this task by proving that, for r ≥ 5 and all n ≥ 0, f(2 rn) - f(2r-1n) ≡ 0 (mod 2r), and that this result is "best possible". Some additional complementary congruence results are also given.

AB - We are given n boxes, labeled 1, 2,..., n. Box i weighs i grams and can support a total weight of i grams. The number of different ways to build a single stack of boxes in which no box will be squashed by the weight of the boxes above it is denoted by f(n). In a 2006 paper, the first author asked for "congruences for f(n) modulo high powers of 2". In this note, we accomplish this task by proving that, for r ≥ 5 and all n ≥ 0, f(2 rn) - f(2r-1n) ≡ 0 (mod 2r), and that this result is "best possible". Some additional complementary congruence results are also given.

UR - http://www.scopus.com/inward/record.url?scp=67549084747&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67549084747&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:67549084747

SN - 1034-4942

VL - 44

SP - 255

EP - 263

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

ER -