'''simple docstring'''




import math






def 							snake_case__				(     _A:   int = 100					)       ->      int:

		'''simple docstring'''


		lowerCAmelCase     =    sum(i * i for i in range(1 ,  n + 1					)					)
		lowerCAmelCase     =    int(math.pow(sum(range(1 ,  n + 1					)					) ,  2					)					)
		return square_of_sum - sum_of_squares


if __name__ == "__main__":
						print(f'{solution() = }')





'''simple docstring'''




def 							snake_case__				(     _A:   int					)       ->      list[int]:

		'''simple docstring'''


		if length <= 0 or not isinstance(_A ,  _A					):
				raise ValueError("""Length must be a positive integer."""					)
		return [n * (2 * n - 1) for n in range(_A					)]


if __name__ == "__main__":
						print(hexagonal_numbers(length=5))
						print(hexagonal_numbers(length=1_0))




