19000

Appears in sequences

• a(n) = floor(n*(n-1)*(n-2)*(n-3)/30).at n=29A011940
• Numbers that are divisible by 10 and are differences between two cubes in at least one way.at n=25A038854
• Numbers n such that sum of the digits of n is >= the sum of the digits of n^4.at n=15A064210
• Numbers divisible by the cube of the sum of their digits in base 10.at n=22A072082
• Maximum value taken on by f(P) = Sum_{i=1..n} p(i)*p(n+1-i) as {p(1),p(2),...,p(n)} ranges over all permutations P of {1,2,3,...,n}.at n=38A087035
• Maximum number of odd 2 X 2 submatrices over all 2n X 2n (0,1) matrices.at n=9A093699
• Numbers with at least two 3s in their prime signature.at n=46A109399
• Multiples of 19 containing a 19 in their decimal representation.at n=30A121039
• Experience Points thresholds for levels in the pen and paper role-playing game "Das Schwarze Auge" (DSA, a.k.a. "The Dark Eye").at n=19A124437
• Numbers k such that k and k^2 use only the digits 0, 1, 3, 6 and 9.at n=48A136850
• Totally multiplicative sequence with a(p) = a(p-1) + 9 for prime p.at n=23A166706
• Integers that can be generated with a C/C++ expression that is shorter than their decimal representation.at n=18A168650
• Square array read by antidiagonals. Convolution of a(n) = 2*a(n-1) - a(n-2) and 10^n.at n=16A178643
• Numbers of the form p^3*q^3*r where p, q, and r are prime.at n=30A179688
• Number of 0..n arrays x(0..3) of 4 elements with each no smaller than the sum of its previous elements modulo (n+1).at n=17A200253
• Number of (w,x,y,z) with all terms in {0,...,n} and w, x, and y even.at n=18A212759
• Number of n step walks (each step +-1 starting from 0) which are never more than 4 or less than -4.at n=15A216212
• Expansion of (1+x)*(1+2*x)*(1-x)/(1-5*x^2+5*x^4).at n=15A217777
• Numbers that are both a sum and a difference of two positive cubes.at n=36A225908
• Numbers k such that the sum of digits of k^2 is 10.at n=43A262713