A star number is a centered figurate number, a centered hexagram $($six$-$pointed star$),$

such as the Star of David, or the board Chinese checkers is played on$.$

The nth star number is given by the formula:

$S_n=6n_{n-1}+1.$

The first $43$ star numbers are: $1,13,37,73,121,181,253,337,433,541,661,$

$793,937,1093,1261,1441,1633,1837,2053,2281,2521,2773,3037,3313,3601,$

$3901,4213,4537,4873,5221,5581,5953,6337,6733,7141,7561,7993,8437,8893,$

$9361,9841,10333,10837.$

Write a recursive $C++$ function to create this sequence for $n0.$