Programs which do a brute-force search for square triangular numbers:

Maple program

C program

How effective are these brute-force search programs? Can you find a square-triangular number greater than one billion? What about greater than one trillion?

It appears that square-triangular numbers are "rare." Can this statement be quantified?