






def 					snake_case	(  lowerCamelCase = 50       ):




	'''simple docstring'''







	__lowercase   							=	[[0] * 3 for _ in range(length + 1       )]

	for row_length in range(length + 1       ):
		for tile_length in range(2					,	5       ):
			for tile_start in range(row_length - tile_length + 1       ):
				different_colour_ways_number[row_length][tile_length - 2] += (
				    different_colour_ways_number[row_length - tile_start - tile_length][
				        tile_length - 2
				    ]
				    + 1
				)

	return sum(different_colour_ways_number[length]       )


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))




