48503

Appears in sequences

• Number of binary strings of length n with no substrings equal to 0001, 0100, or 0111.at n=21A164464
• Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,7}) exceeds the largest prime factor of product(n+k, {k,0,7}).at n=20A199407
• Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,8}) exceeds the largest prime factor of product(n+k, {k,0,8}).at n=22A200566
• Integers n such that for all i > n the largest prime factor of product(i+k, {k,0,14}) exceeds the largest prime factor of product(n+k, {k,0,14}).at n=44A209838
• Irregular triangle read by rows where T(n,k) is the number of simple graphs covering n vertices with exactly k triangles, 0 <= k <= binomial(n,3).at n=52A372167