44770

Appears in sequences

• a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=5.at n=20A022310
• Let u(1)=u(2)=u(3)=1, u(n+3)=(n*u(n)+(n+1)*u(n+1)+(n+2)*u(n+2))/(n+3); sequence gives values of n such that u(n) is an integer.at n=11A075770
• Half the number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having two or four distinct clockwise edge differences.at n=3A209906
• Half the number of (n+1)X5 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences.at n=0A209909
• T(n,k)=Half the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences.at n=6A209913
• T(n,k)=Half the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences.at n=9A209913
• Number of (w,x,y,z) with all terms in {1,...,n} and w>2x and y<3z.at n=22A212516
• Nonsquarefree integers m such that, for prime p, if p^k|m then 2+p^k|2+m.at n=0A225814