31112

Appears in sequences

• Array in which the n-th row contains the multiples of n using nonzero digits and having a digit sum of n. Sequence contains the rows and a zero entry for rows with no terms (e.g. 10).at n=39A077755
• Numbers k such that (k / sum of digits of k) and (k+1 / sum of digits of k+1) are both prime.at n=27A085775
• Number of partitions of 2n free of multiples of 8 such that 4 occurs at most once. All odd parts occur with even multiplicities. There is no restriction on the other even parts.at n=29A100684
• Integers corresponding to rational knots in Conway's enumeration.at n=23A122495
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, -1), (0, 1, 1), (1, -1, -1)}.at n=11A148216
• a(n) = a(n-1) + a(n-2) - [a(n-4)/4] - [a(n-5)/2] - [a(n-6)/4].at n=26A173597
• Composite numbers whose product of digits is 6.at n=34A201055
• Array read by antidiagonals: T(m,n) = m*(m+n-1)! + Sum( n <= i <= m+n-2 ) i!at n=26A211369
• Numbers that eventually reach 1 under "x -> sum of 4th power of digits of x".at n=21A219111
• Number of (n+1) X (2+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).at n=1A234453
• 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 1 (constant-stress 1 X 1 tilings).at n=4A234458
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7.at n=12A252400
• Number of (n+2) X (3+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000101 or 00000111.at n=10A261706
• Intersection of A003052 and A283002.at n=39A283003
• a(n) = Sum_{-n<i<n, -n<j<n, gcd{i,j}=1} (n-|i|)*(n-|j|).at n=14A331771
• A puzzle array read by antidiagonals.at n=47A358349