48490

Appears in sequences

• a(0)=1, a(n) = a(n-1) - Sum_{k=2..n} mu(k) * a(n-k), where mu(k) is the Moebius function of k.at n=18A072810
• Number of convex polyominoes with a 3 X n+1 minimal bounding rectangle.at n=13A093119
• a(n) = floor(8^n/3^n).at n=11A094976
• Integers n such that 8*10^n+21 is prime.at n=15A111022
• Number of nX3 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally.at n=4A229375
• Number of nX5 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally.at n=2A229377
• T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally.at n=23A229380
• T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally.at n=25A229380