The Link has change to: Enumerating Possible Sudoku Grids. Although enumerating implies listing them all, which they didn't.
The second write up they changed the name to Math of Sudoku I.
The question is vague enough to note that Nmax is 6, 670, 903, 752, 021, 072, 936, 960 and Nmin is the number of unique equivalence classes which is 5,472,730,538. Multiply this by 3,359,232 reorderings and 9! relabelings and you get roughly Nmax plus some extra caused by over-counting automorphisms.
But the question is actually how may sudoku puzzles, which none of these answers... answers.
You can start by taking all girds, Nmax and subtracting 1 clue from each getting 81xNmax. Then you can start again and take subtract 2 clues so there is C(81,2)xNmax. Then C(81,3)xNmax, etc. and sum them all. So Sigma of N=17 to 81 of C(81,n) will get you close, but you will need a Big Int package to compute this.
You could substitute Nmin here to save some work. ;')
But there is the question of solvability. If there are 4 or more missing clues you have to deal with unavoidable loops, where one of the four has to be filled for the puzzle to be solvable. And there are loops greater than four.
Then somewhere along the way you start having unsolvable puzzles with a large number of clues, sort of a max-min situation. Maybe for reasons other than unavoidable loops?
Then down at the low end you need at least 17 clues remaining to have a solvable puzzle. There are 49158 17 clue puzzles and they have all been found. Work is ongoing to count 18 clue puzzles, which don't contain 17 clue puzzles.
So it might be a while before we have an actual answer to this question.