106891

Appears in sequences

• Indices of primes in sequence defined by A(0) = 37, A(n) = 10*A(n-1) + 27 for n > 0.at n=13A101849
• a(1)=1. a(n) = n*a(n-1) if n*a(n-1) has a fewer number of divisors than n+a(n-1) does. a(n) = n+a(n-1) if n*a(n-1) has a greater or equal number of divisors than n+a(n-1) does.at n=15A134190
• Number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having zero permanent.at n=3A206466
• Number of (n+1)X5 0..2 arrays with every 2X2 subblock having zero permanent.at n=1A206468
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having zero permanent.at n=11A206472
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having zero permanent.at n=13A206472