login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094800 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
0, 200000, 2600000, 35000000, 35200000, 500000000, 500200000, 502600000, 535000000, 535200000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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

REFERENCES

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

LINKS

Table of n, a(n) for n=1..10.

CROSSREFS

Cf. A014778.

Cf. A094798, A094799, A094801.

Sequence in context: A164321 A230019 A106777 * A200863 A179224 A237374

Adjacent sequences:  A094797 A094798 A094799 * A094801 A094802 A094803

KEYWORD

base,easy,fini,full,nonn

AUTHOR

Lekraj Beedassy, Jun 11 2004

EXTENSIONS

Corrected by David Wasserman, Jun 29 2007. There are no further terms.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 16 23:49 EDT 2019. Contains 325092 sequences. (Running on oeis4.)