42661

Appears in sequences

• Strong pseudoprimes to base 87.at n=22A020313
• Number of partitions p of n such that median(p) < multiplicity(min(p)).at n=44A240212
• Number of (n+2)X(4+2) 0..1 arrays with each row and column divisible by 7, read as a binary number with top and left being the most significant bits.at n=5A262316
• Number of (n+2)X(6+2) 0..1 arrays with each row and column divisible by 7, read as a binary number with top and left being the most significant bits.at n=3A262318
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column divisible by 7, read as a binary number with top and left being the most significant bits.at n=39A262319
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column divisible by 7, read as a binary number with top and left being the most significant bits.at n=41A262319
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1)*b(n), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences.at n=15A296273