49000

Appears in sequences

• Numbers of form 7^i*10^j, with i, j >= 0.at n=18A025632
• Mean integral quotients associated with A048753.at n=18A048754
• Numbers whose square has more than 2/3 of its digits the same.at n=30A060813
• Taylor coefficients at x=0 of exp(exp(x^3/3+x^2/2)-1).at n=9A081096
• Minimal m > 0 such that Fibonacci(m) == 0 (mod n^3).at n=34A132633
• Triangle read by rows: T(n,k) = number of forests on n labeled nodes, where k is the maximum of the number of edges per tree (n>=1, 0<=k<=n-1).at n=32A143911
• a(n) = 1, 7, A011557*(period 6: repeat 10, 13, 31, 49, 70, 97).at n=23A178508
• Numbers with prime factorization p^2*q^3*r^3 where p, q, and r are distinct primes.at n=8A190106
• Achilles number whose largest proper divisor is also an Achilles number.at n=27A203662
• Number of n X 7 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=4A208141
• Number of 5Xn 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=6A208144
• Numbers k such that the sum of prime factors of k (counted with multiplicity) equals five times the largest prime divisor of k.at n=22A212863
• G.f.: exp( Sum_{n>=1} x^n * (1+x)^n / (n*(1-x^n)) ).at n=19A227681
• Numbers n such that n^3 = a^2 + b^2 and a^3 + b^3 is a square, for some positive integers a and b.at n=16A257965
• Numbers k such that sum of digits of k^2 is 7.at n=21A262711
• 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 0,1 or 1,2.at n=18A264341
• Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 0,1 or 1,2.at n=2A264344
• a(n) = n! * Laguerre(n, 2*n, -n).at n=4A295406
• Composites c where an integer b with 1 < b < c exists such that when the k digits in the base-b expansion of c are considered as exponents in an ordered list of primes prime(1), prime(2), ..., prime(k), then Product_{i=1..k} prime(i)^d[i] = c, where d[h] gives the h-th most significant digit in the expansion.at n=23A307458
• Array read by antidiagonals: T(n,k) = n^3*k^3*(n+k)^2, n>=0, k>=0.at n=30A358292