95000

Appears in sequences

• A convolution triangle of numbers obtained from A036083.at n=32A030527
• a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 50.at n=2A093250
• Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 9.at n=42A136914
• Numbers k such that k and k^2 use only the digits 0, 2, 5, 7 and 9.at n=53A136917
• Numbers k such that k and k^2 use only the digits 0, 2, 5, 8 and 9.at n=29A136919
• Numbers k such that k and k^2 use only the digits 0, 2, 5 and 9.at n=21A136920
• Minimal covering numbers.at n=42A160559
• For any k, the cumulative sum a(1) + a(2) + a(3) + ... + a(k) shares at least five digits with a(k). Lexicographically first sequence of positive integers without duplicate terms having this property.at n=41A326640
• a(n) = Sum_{k = 0..n} k * binomial(n,k)^2 * binomial(n+k,k)^2.at n=4A357510
• Table T(n,k) read by antidiagonals: T(n,k) (n >=1, k >= 2) is the number of inversions in the radix-k digit reversal permutation of 0, 1, ..., k^n-1.at n=24A376790