benchmarks.wiki / Public workspace

Omni-MATH / Find, with proof, the number of positive integers whose base- n representation consists of distinct digits with the property that, except for the leftmost digit, every digit differ…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Find, with proof, the number of positive integers whose base- nn representation consists of distinct digits with the property that, except for the leftmost digit, every digit differs by ±1\pm 1 from some digit further to the left. (Your answer should be an explicit function of nn in simplest form.)
Plain-text mathematical notation (without MathML)
Find, with proof, the number of positive integers whose base- n representation consists of distinct digits with the property that, except for the leftmost digit, every digit differs by ±1 from some digit further to the left.  (Your answer should be an explicit function of n in simplest form.)
Original LaTeX notation
Find, with proof, the number of positive integers whose base- $n$ representation consists of distinct digits with the property that, except for the leftmost digit, every digit differs by $\pm 1$ from some digit further to the left.  (Your answer should be an explicit function of $n$ in simplest form.)

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import