Let Z≥0 denote the set of nonnegative integers.Define a function f:Z≥0→Z with f(0)=1 and f(n)=512⌊n/10⌋f(⌊n/10⌋)
for all n≥1. Determine the number of nonnegative integers n such that the hexadecimal (base 16) representation of f(n) contains no more than 2500 digits.Proposed by Tristan Shin