450000

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*10^j.at n=19A038300
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*9^j.at n=16A038311
• Row sums of convolution triangle A030523.at n=10A039717
• For n>3: a(n) is a multiple of three distinct earlier terms.at n=35A060301
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,47.at n=24A064260
• Numbers of the form (5^i)*(12^j), with i, j >= 0.at n=28A108201
• Total number of digits in all n-digit nonnegative integers.at n=4A113119
• Numbers k such that k and k^2 use only the digits 0, 2, 4 and 5.at n=50A136897
• Number of n-digit even numbers.at n=5A137233
• a(n) = 10^n*C(2n,n)/C(n+3,3).at n=5A156125
• Numbers n such that 10^11 + n^2 is a square.at n=7A180974
• a(n) = 9*n*10^(n-1).at n=4A212704
• Expansion of (1+x)*(1+2*x)*(1-x)/(1-5*x^2+5*x^4).at n=20A217777
• Fixed points of A225546.at n=47A225547
• Numbers whose cube is of the form a^5 + b^5 - c^5 with a >= b > 0 and c not in {a,b}.at n=18A257298
• Number of (n+1) X (4+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,2 or 2,-2.at n=4A264056
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,2 or 2,-2.at n=32A264059
• Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 1,2 or 2,-2.at n=3A264062
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,-2 or 1,1.at n=37A264142
• a(n) = Sum_{k >= 0}(-1)^k*binomial(n,5*k).at n=22A289306