This is incorrect. Putting a finite bound on n does not reduce n to 1. n is always meant to be a finite arbitrarily large value. n=INT_MAX qualifies as arbitrarily large, especially on a 64-bit system.
If an algorithm will always take 1 billion years to complete regardless of the input, then it's still O(1).
The behaviour does flatline as n approaches infinity