145680domain: NAppears in sequencesa(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 6) so far).at n=37A060733Numbers n such that n^2+k-1 is the sum of two nonzero squares in exactly k ways for all k = 1, 2, 3.at n=12A273341