303146

Appears in sequences

• a(n) = Sum_{m=1..n} gcd(s(n,m), S(n,m)), where s(n,m) is an unsigned Stirling number of the first kind and S(n,m) is a Stirling number of the second kind.at n=16A128266
• Integers that concatenate 3 counts: the number of terms in the sequence so far, the number of primes in the sequence so far, the number of digits in the sequence so far, with a(1)= 113. The sequence is always extended with the smallest available integer not leading to a contradiction or a dead end.at n=29A309617