69375
domain: N
Appears in sequences
- a(n) is number of strings of length n that can be obtained by starting with abc and repeatedly doubling any substring in place and then discarding any string that contains two successive equal letters.at n=23A135017
- Numbers which can be expressed as the product of numbers made of only fives.at n=21A161143
- Sum of all the n-digit numbers whose digits are all odd.at n=2A192107
- Integer areas of the Lucas Central triangles of integer-sided triangles.at n=5A231739
- Numbers k such that k and k+1 have different (ordered) prime signatures and d_3(k) = d_3(k+1), where d_3 is A007425.at n=7A333057
- a(0) = 1, a(1) = 0; a(n+2) = Sum_{k=0..n} Stirling2(n,k) * a(k).at n=11A345177
- Numbers m such that the largest digit in the decimal expansion of 1/m is 4.at n=28A351470