The OEIS is supported by the many generous donors to the OEIS Foundation.

First term of a run of exactly two consecutive numbers such that for each m in the run, exactly m 1's are used in writing out all numbers 1 through m.

1

`%I #5 Mar 31 2012 13:20:57
`

`%S 0,200000,2600000,35000000,35200000,500000000,500200000,502600000,
`

`%T 535000000,535200000
`

`%N First term of a run of exactly two consecutive numbers such that for each m in the run, exactly m 1's are used in writing out all numbers 1 through m.
`

`%C Numbers n such that n and n+1 are members of A014778, but n-1 and n+2 are not. - David Wasserman
`

`%D M. Protat, Des Olympiades a l'Agregation, Nombre de "1", Problem 89, pp. 182-183, Ellipses, Paris 1997.
`

`%Y Cf. A014778.
`

`%Y Cf. A094798, A094799, A094801.
`

`%K base,easy,fini,full,nonn
`

`%O 1,2
`

`%A _Lekraj Beedassy_, Jun 11 2004
`

`%E Corrected by _David Wasserman_, Jun 29 2007. There are no further terms.
`