19635

Appears in sequences

• Fibonomial coefficients: a(n) = F(n+1) * F(n+2) * F(n+3)/2, where F() = Fibonacci numbers A000045.at n=7A001655
• a(n) = floor(n(n+2)(2n+1)/8).at n=42A002717
• Odd primitive abundant numbers.at n=27A006038
• Triangle of Fibonomial coefficients, read by rows.at n=58A010048
• Triangle of Fibonomial coefficients, read by rows.at n=62A010048
• Expansion of x/(1 - 7*x - 2*x^2).at n=6A015555
• Expansion of Product_{m>=1} (1-m*q^m).at n=36A022661
• a(n) = n*(n+1)*(n+2)/2.at n=33A027480
• a(n) = n*(2*n-1)*(2*n+1).at n=17A035328
• Odd numbers with exactly 5 distinct prime factors.at n=1A046391
• Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n-2)/2.at n=24A047190
• Lonely numbers: distance to closest prime sets a new record.at n=16A051650
• Smallest number at distance n from nearest prime.at n=26A051652
• Maximal value of products of partitions of n into powers of distinct primes (powers of 1 and 2 excluded).at n=43A051704
• Smallest number at distance 2n from nearest prime.at n=13A051728
• Signed Fibonomial triangle.at n=62A055870
• Signed Fibonomial triangle.at n=58A055870
• Fibonomial coefficients.at n=3A056565
• a(n) = lcm(n, n+1, n+2, n+3)/12.at n=32A067047
• Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer.at n=24A075460