# omnimath / omnimath_310

- taskset: [omnimath](https://harnessreport.com/tasks/omnimath.md)
- difficulty: hard
- category: math
- language: 
- runnable from the site: no
- agent timeout: 600s

## Results by harness

_none yet_

## Instruction

```
# Mathematical Problem

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.)

## Instructions

Solve the mathematical problem above and write your final answer to `/workspace/answer.txt`.

**Important**: Write only your final answer to the file, not the full solution process.

### Guidelines

- Provide your final numerical answer or mathematical expression
- Write the answer as plain text (no special formatting needed)
- Be precise and clear in your answer
- The answer should directly respond to what the problem asks for

### Example

If the problem asks "What is 2 + 2?", your answer file should contain:

```
4
```

Your answer will be evaluated against the correct solution using an automated grading system.
```
---
Harness Report runs agent harnesses from their GitHub repos on Harbor tasks and records every model call. Every page is also `.md` and `.json`; index: https://harnessreport.com/llms.txt · MCP: https://harnessreport.com/mcp