170568

Appears in sequences

• Number of nX4 0..1 arrays with row sums and column sums unimodal.at n=4A223713
• Number of n X 5 0..1 arrays with row sums and column sums unimodal.at n=3A223714
• T(n,k)=Number of nXk 0..1 arrays with row sums and column sums unimodal.at n=31A223716
• T(n,k)=Number of nXk 0..1 arrays with row sums and column sums unimodal.at n=32A223716
• Number of (n+1) X (n+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=3A235018
• 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, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=3A235022
• 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, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=24A235026
• Consider the unitary aliquot parts, in ascending order, of a composite number. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to the reverse of themselves.at n=9A258270