50002

Appears in sequences

• Numbers n such that n concatenated with n+1 is triangular.at n=19A094609
• Primitive sliding numbers (excludes multiples of 10): totals, including repetitions, of sums r + s, r >= s, such that 1/r + 1/s = (r + s)/10^k for some k >= 0.at n=40A103184
• Numbers that require exactly five chisel strokes when written in Roman numerals.at n=37A133192
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 5.at n=53A136882
• Numbers k such that k and k^2 use only the digits 0, 2, 4 and 5.at n=32A136897
• Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 7.at n=48A136899
• Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 8.at n=57A136900
• Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x+3)^k for 0 <= k <= n.at n=48A248811
• Numbers k such that k-1 | concat(k, k+1).at n=17A281233
• Sum of the odd parts in the partitions of n into 9 parts.at n=38A309657
• Numbers k that are a substring of k*(k-1).at n=26A316263
• Number of strict solid partitions of n.at n=31A323657
• Sliding numbers which are products of three distinct primes.at n=11A357670