fibonacci with LRU cache for memoization

fibonacci.py

from functools import lru_cache

@lru_cache(maxsize=100)
def fibonacci(n):
  # Check that the input is a positive integer
  if type(n) != int:
    raise TypeError("n must be a positive int")
  if n < 1:
    raise ValueError("n must be a positive int")
    
  # Compute the Nth term
  return 1 if (1<=n<=2) else (fibonacci(n-1) + fibonacci(n-2))

if __name__ == "__main__":
  for n in range(1, 101):
    print("{0:<5} : {1}".format(n, fibonacci(n)))