34539

Appears in sequences

• If mod(n,3)=0 then a(n) = a(n-1), if mod(n,3)=1 then a(n) = Q(n-2)+Q(n-3), if mod(,n,3)=2 then a(n-3)+a(n-4)+a(n-5), where Q() = A005185().at n=53A102149
• If mod(n,3)=0 then a(n) = a(n-1), if mod(n,3)=1 then a(n) = Q(n-2)+Q(n-3), if mod(,n,3)=2 then a(n-3)+a(n-4)+a(n-5), where Q() = A005185().at n=54A102149
• Numbers n with k divisors such that n-1 and n+1 in binary representation have same number k of 0's as 1's.at n=34A191369
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,0 0,1 1,0 -2,-1 or -1,-2.at n=6A264167
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -2,-1 or -1,-2.at n=29A264172
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -2,-1 or -1,-2.at n=34A264172