ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let InI_n be the number of ones in row m=2nm=2^n of the Pascal rhombus, with entries reduced modulo 22. Klostermeyer et al.'s row-count formula conjecture. Then

In=13(2n+2−(−1)n).I_n=\frac{1}{3}\left(2^{n+2}-(-1)^n\right).

The formula predicts the number of odd entries in power-of-two rows and is part of the proposed structural theory of the Pascal rhombus modulo 22; the source gives no resolution evidence.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.