code: 
  """simple docstring"""
  def     __lowerCamelCase  (		UpperCamelCase__ = 1000      ):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	_UpperCAmelCase =						0
  	_UpperCAmelCase =						(n - 1) // 3
  	total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
  	_UpperCAmelCase =						(n - 1) // 5
  	total += ((terms) * (10 + (terms - 1) * 5)) // 2
  	_UpperCAmelCase =						(n - 1) // 15
  	total -= ((terms) * (30 + (terms - 1) * 15)) // 2
  	return total
  
  
  if __name__ == "__main__":
  			print(f'''{solution() = }''')
  
  
  
  
  
style_context: 
  """simple docstring"""
  def     __lowerCamelCase  (		UpperCamelCase__      ):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	if not isinstance(UpperCamelCase__				,     UpperCamelCase__      ):
  		raise TypeError("recursive_lucas_number accepts only integer arguments."      )
  	if n_th_number == 0:
  		return 2
  	if n_th_number == 1:
  		return 1
  
  	return recursive_lucas_number(n_th_number - 1      ) + recursive_lucas_number(
  	    n_th_number - 2      )
  
  
  
  
  def     __lowerCamelCase  (		UpperCamelCase__      ):
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  	if not isinstance(UpperCamelCase__				,     UpperCamelCase__      ):
  		raise TypeError("dynamic_lucas_number accepts only integer arguments."      )
  	_UpperCAmelCase ,      _UpperCAmelCase =						2, 1
  	for _ in range(UpperCamelCase__      ):
  		_UpperCAmelCase ,      _UpperCAmelCase =						b, a + b
  	return a
  
  
  if __name__ == "__main__":
  			from doctest import testmod
  
  			testmod()
  			__magic_name__		       =				int(input('''Enter the number of terms in lucas series:\n''').strip())
  			print('''Using recursive function to calculate lucas series:''')
  			print(''' '''.join(str(recursive_lucas_number(i)) for i in range(n)))
  			print('''\nUsing dynamic function to calculate lucas series:''')
  			print(''' '''.join(str(dynamic_lucas_number(i)) for i in range(n)))
  
  
  
  
  