Conjecture that the two layered-number sequences coincide
Statement
For each positive integer , let and denote the two integer sequences defined in the paper, where is the least integer admitting an -layered partition and is the least -layered number. Sequence-equality conjecture.
for every positive integer . The conjecture asserts that the least integer with an -layered partition is itself the least -layered number; the supplied context gives examples for .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.