310365

Appears in sequences

• a(1) = 3, a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1), or which can be obtained by inserting digits anywhere in a permutation of digits of a(n-1) (prefix, suffix or insertion). Zeros are not to be suffixed. a(n) is not divisible by 10.at n=4A077698
• Number of n X 4 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=3A280669
• T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=24A280673
• Number of 4Xn 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=3A280676