100935

Appears in sequences

• Number of (n+1)X(n+1) 0..6 arrays with every 2X2 subblock summing to 12.at n=2A183663
• Number of (n+1) X 4 0..6 arrays with every 2 X 2 subblock summing to 12.at n=2A183666
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock summing to 12.at n=12A183672
• Smallest number requiring n steps to reach a palindrome under the "add a digit" process described in A241173.at n=23A241174
• Integers n not of form 3m+2 such that for any integer k > 0, n*10^k+1 has a divisor in the set { 7, 11, 13, 37 }.at n=23A243969