43750

Appears in sequences

• Triangle of coefficients in expansion of (1+5x)^n.at n=40A013612
• Expansion of 1/(1-5*x)^5.at n=4A036071
• Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).at n=40A038243
• Stirling2 triangle with scaled diagonals (powers of 5).at n=24A075500
• Fourth column of triangle A075500.at n=3A075912
• Hypotenuses for which there exist exactly 5 distinct Pythagorean triangles.at n=10A084649
• a(n) = Sum_{i=n..n+3} Sum_{j=i+1..n+4} prime(i)*prime(j).at n=16A127350
• Triangle T(n,k) = (k+1)^(n-k)*binomial(n,k).at n=40A154372
• Integers for which the decimal expansion of the reciprocal contains the repeating digits 1,4,2,8,5,7 (corresponding to the decimal expansion of 1/7).at n=43A178335
• Number of nondecreasing arrangements of n numbers x(i) in -(2n-2)..(2n-2) with the sum of sign(x(i))*x(i)^2 zero.at n=7A187993
• Number of nondecreasing arrangements of n numbers x(i) in -(n+6)..(n+6) with the sum of sign(x(i))*x(i)^2 zero.at n=7A188001
• Number of nondecreasing arrangements of 8 numbers x(i) in -(n+6)..(n+6) with the sum of sign(x(i))*x(i)^2 zero.at n=7A188008
• a(n) = n*(n + 5)*(n + 10)*(n + 15)/24.at n=25A264446
• Number x = concat(MSD(x),b) such that MSD(x)*b = phi(x), where MSD(x) is the Most Significant Digit of x and phi(x) is the Euler totient function of x.at n=29A286130
• Triangle read by rows: T(0,0) = 1; T(n,k) = 5*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=46A305837
• Triangle read by rows: T(0,0)= 1; T(n,k)= T(n-1,k) + 5*T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=46A305838
• Infinitary weird numbers (A306984) whose number of divisors is not a power of 2.at n=7A335936
• a(n) is the conjectured largest number such that both a(n) and a(n) - n are 7-smooth numbers. a(n) can be less than n. Otherwise, if no such number exists then a(n) = 0.at n=9A376924