39395

Appears in sequences

• a(n) = Sum_{j=0..n} T(n, j), where T is given by A026552.at n=12A026564
• a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 2] as of [1, 2, 1].at n=10A211289
• Numbers of the form x^3 + SumOfCubedDigits(x).at n=34A225051
• Count of the first 10^n primes containing at least one 4's digit.at n=4A231790
• Semiprimes p*q such that p*q+p+q, p*q-(p+q), p*q+2*(p+q) and p*q-2*(p+q) are all primes.at n=29A356765
• Number of proper 5-partitions of the fan graph on n vertices such that every triangle uses exactly 2 colors.at n=8A390131