28000

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*10^j.at n=13A038276
• Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*7^j.at n=11A038309
• Number of nested algorithms a(m,n) where m is the number of items in a contaminated group and n is the total number of unclassified items (0 <= m <= n) (values read by antidiagonals).at n=25A055633
• Numbers divisible by the cube of the sum of their digits in base 10.at n=30A072082
• Numbers n in which the last K digits of n form an integer divisible by K^3, for K = 1, 2, ..., M, where M is the number of digits in n.at n=38A079239
• Consider 3 X 3 X 3 Rubik cube, but consider only positions of corners; sequence gives number of positions that are exactly n moves from the start.at n=4A080629
• Numbers which are sums of two, three, four and also sums of five cubes.at n=34A085338
• Arithmetic derivative of 10^n.at n=4A085708
• a(n) = n*(n+1)*(n+2)*a(n-1)/6 for n >= 1; a(0) = 1.at n=5A087047
• a(n) = A063997(n)/4.at n=36A088406
• Signed triangle used to compute column sequences of array A078741 ((3,3)-Stirling2).at n=38A090219
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^7-M)/6, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=32A096041
• Numbers k such that k and k^2 use only the digits 0, 2, 4, 7 and 8.at n=40A136906
• Partition number array, called M32(-2), related to A004747(n,m) = |S2(-2;n,m)| (generalized Stirling triangle).at n=32A143172
• Partition number array, called M31(4), related to A049352(n,m)= |S1(4;n,m)| (generalized Stirling triangle).at n=35A144354
• Partition number array, called M31(-5), related to A049411(n,m) = S1(-5;n,m) (generalized Stirling triangle).at n=35A144879
• Successive differences of A000990.at n=29A147766
• Triangle T(n,m,p,q) = (p^(n-k)*q^k + p^k*q^(n-k))*(StirlingS2(n, k) + StirlingS2(n, n-k)) with p=2 and q=5, read by rows.at n=17A154922
• Triangle T(n,m,p,q) = (p^(n-k)*q^k + p^k*q^(n-k))*(StirlingS2(n, k) + StirlingS2(n, n-k)) with p=2 and q=5, read by rows.at n=18A154922
• a(n) = smallest k having n prime factors such that k + sum of the prime factors of k also has n prime factors.at n=7A159235