41112

Appears in sequences

• Positive numbers n such that n is a multiple of (product of digits of n) * (sum of digits of n).at n=19A049102
• Numbers k such that k divided by ((sum of digits of k) multiplied by (product of digits of k)) is prime.at n=4A066042
• Multiples of 2 in which there is no common digit in successive terms.at n=31A083490
• Multiples of 3 in which there is no common digit in successive terms.at n=29A083491
• Multiples of 4 in which there is no common digit in successive terms.at n=29A083492
• Multiples of 6 in which there is no common digit in successive terms.at n=27A083494
• Multiples of 8 in which there is no common digit in successive terms.at n=24A083496
• Integers corresponding to rational knots in Conway's enumeration.at n=36A122495
• Any two consecutive digits in the sequence sum up to a prime.at n=41A158652
• Coefficient triangle for the monic associated Laguerre-Sonin(e) polynomials of order one for parameter alpha=1.at n=23A201201
• Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=5A207343
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=50A207346
• Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 0 and 1 1 1 vertically.at n=4A207350
• a(n) is the number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1] as of [2, 3].at n=11A211278
• a(1) = 0; for n > 1: a(n) = smallest even number greater than a(n-1) which does not use any digit used by a(n-1).at n=32A229363
• Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=3A234543
• Number of (n+1) X (4+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=0A234546
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=6A234549
• T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=9A234549
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=27A250812