OT - Self-referential number puzzle

[QuikSand]

Your task is to fill in the spaces in the selection below with simple integers, so that the entire selection is true. There's no wordplay involved, or anything else shifty - it's just a mater of finding the set of responses that don't invalidate something elsewhere in the group:

- - - - -

The number 0 appears __ times.
The number 1 appears __ times.
The number 2 appears __ times.
The number 3 appears __ times.
The number 4 appears __ times.
The number 5 appears __ times.
The number 6 appears __ times.
The number 7 appears __ times.
The number 8 appears __ times.
The number 9 appears __ times.

- - - - -

Your job - copy the text between the dividers, and paste it with your responses in each blank so that each line is true for the entire selection. For instance, you cannot put a "1" on the second line, because once you do, there are two instances of the number "1" in the selection. If you put down a "2" on the second line, then you can only use the number "1" one more time anywhere else in the puzzle, so the total works out correctly.

Good luck.

[QuikSand]

Oh, forgive the grammar error caused by the phrase "1 times" - not intended to alter the puzzle.

[Maple Leafs]

I have an answer, but I can't remember how to do the invisible text trick so I'll let others have a shot at it.

[Celeval]

Spoilers....?








The number 0 appears 1 times.
The number 1 appears 7 times.
The number 2 appears 3 times.
The number 3 appears 2 times.
The number 4 appears 1 times.
The number 5 appears 1 times.
The number 6 appears 1 times.
The number 7 appears 2 times.
The number 8 appears 1 times.
The number 9 appears 1 times.

What am I missing, because I know I'm not that good at these. :) There seems to be a rule buildable out of this somewhere...

[digamma]

That's what I have too, Celevel.

[Maple Leafs]

Me too.

[QuikSand]

That's what I get, too. Okay, not so tough, eh?

[tucker342]

that's what I got...