63280

Appears in sequences

• a(n+2) = 9*a(n+1) - a(n) + 1, with a(1)=1, a(2)=10.at n=5A092420
• Number of subsets of {1..n} (including empty set) such that the pairwise GCDs of elements are not distinct.at n=31A196720
• 1/4 the number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=4A209709
• 1/4 the number of (n+1)X6 0..3 arrays with every 2X2 subblock having distinct clockwise edge differences.at n=0A209713
• T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having distinct clockwise edge differences.at n=10A209716
• T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having distinct clockwise edge differences.at n=14A209716
• a(n) is the number of positive Euler permutations of order n.at n=9A347601