50139

Appears in sequences

• Numbers k such that the k-th triangular number contains each of the 10 decimal digits exactly once.at n=2A115939
• Number of nX5 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=5A207416
• Number of nX6 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=4A207417
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=49A207419
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=50A207419
• a(n) is the number of distinct products p of Fibonacci numbers such that Fibonacci(n) < p <= Fibonacci(n + 1).at n=52A286948