100050

Appears in sequences

• Numbers having four 0's in base 10.at n=22A043492
• Triangle read by rows: n-th row contains the first n n-digit multiples of n with digit sum n. If there are fewer than n such numbers, the rest of the row is filled with 0's.at n=17A084029
• Numbers that require exactly five chisel strokes when written in Roman numerals.at n=45A133192
• a(n) = n^5 + 5n.at n=10A180355
• Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y>=3z.at n=30A212515
• a(n) = 10^n + 10*n.at n=5A213223
• a(n) = Sum_{d|n} sigma_3(d).at n=41A321140
• Indices n of j-points j(n) for successive positive maxima of the Riemann zeta function on critical line.at n=35A327546
• Numbers of squares and rectangles of all sizes in 3*n*(n+1)/2-ominoes in form of three-quarters of Aztec diamonds.at n=23A338996
• Numbers k such that the digits of k^2 are a subsequence of the digits of k^3.at n=19A362002
• Irregular triangle read by rows: T(n,k) (n >= 4, 4 <= k <= A384502(n)) is the smallest n-digit number m with k distinct prime factors, such that these factors can be divided into two subsets of at least two elements each, both summing to the same value. If no such number exists, T(n,k) = -1.at n=5A383858
• Expansion of (1+x-x^2+x^3) / (1-x-5*x^2+x^3+2*x^4).at n=12A384642