140000

Appears in sequences

• Number of positive integers <= 2^n of form 5 x^2 + 9 y^2.at n=21A054179
• Numbers divisible by the 4th power of the sum of their digits in base 10.at n=15A072083
• Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 9.at n=53A136862
• a(n) = 10^n*Catalan(n).at n=4A156275
• Totally multiplicative sequence with a(p) = 10*(p+2) for prime p.at n=29A167311
• Totally multiplicative sequence with a(p) = 2*(2p+1) = 4p+2 for prime p.at n=47A167334
• Integers that can be generated with a C/C++ expression that is two or more characters shorter than their decimal representation.at n=13A168651
• Partial sums of A007202 (crystal ball sequence for hexagonal close-packing).at n=19A186707
• Numbers with prime factorization pq^4r^5.at n=24A190468
• Number of (w,x,y,z) with all terms in {0,...,n} and max{w,x,y,z}>2*min{w,x,y,z}.at n=19A212743
• a(n) = n^4 if n odd, 7*n^4/8 if n even.at n=20A309338
• 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=31A376924