human
Sum of Fibonacci numbers at even indexes upto N terms | Computes value of first fibonacci numbers and stores the even - indexed sum.
Initialize result.
Add remaining terms.
For even indices.
Return the alternting sum.
Driver code.
Get n.
Find the even - indiced sum"
How can the above be solved in Python?

=====
What is a code to sum of Fibonacci numbers at even indexes upto N terms and the other steps required?
assistant
#Here is code to sum of Fibonacci numbers at even indexes upto N terms and the other steps required.
 def calculateEvenSum ( n ) :
	if n <= 0 :
		return 0
	fibo = [ 0 ] * ( 2 * n + 1 )
	fibo [ 0 ] , fibo [ 1 ] = 0 , 1
	sum = 0
	for i in range ( 2 , 2 * n + 1 ) :
		fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ]
		if i % 2 == 0 :
			sum += fibo [ i ]
	return sum
if __name__ == " _ _ main _ _ " :
	n = 8
	print ( " Even ▁ indexed ▁ Fibonacci ▁ Sum ▁ upto " , n , " terms : " , calculateEvenSum ( n ) )