|
Search: id:A094799
|
|
|
| A094799 |
|
First term of a run of 10 consecutive numbers such that for each m in the 10-tuple exactly m 1's are used in writing out all numbers 1 through m. |
|
+0
3
|
|
| 199981, 1599981, 35199981, 500199981, 501599981, 535199981
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The sequence is complete. - David Wasserman (wasserma(AT)spawar.navy.mil), Jun 29 2007
|
|
REFERENCES
|
M. Protat, Des Olympiades a l'Agregation, Nombre de "1", Problem 89, pp. 182-183, Ellipses, Paris 1997.
|
|
CROSSREFS
|
Cf. A014778.
Cf. A094798.
Sequence in context: A043592 A126558 A014778 this_sequence A163500 A164321 A106777
Adjacent sequences: A094796 A094797 A094798 this_sequence A094800 A094801 A094802
|
|
KEYWORD
|
base,easy,fini,full,nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 11 2004
|
|
|
Search completed in 0.002 seconds
|
