Sum of square of first n odd numbers | Efficient C ++ method to find sum of square of first n odd numbers . ; driver code
#include <iostream> NEW_LINE using namespace std ; int squareSum ( int n ) { return n * ( 4 * n * n - 1 ) / 3 ; } int main ( ) { cout << squareSum ( 8 ) ; return 0 ; }