44901

Appears in sequences

• Numbers k such that 141*2^k+1 is prime.at n=49A032420
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (0, 1, -1), (1, 0, -1), (1, 0, 1)}.at n=9A149368
• Number of length-n 0..4 arrays with no following elements larger than the first repeated value.at n=6A267467
• T(n,k)=Number of length-n 0..k arrays with no following elements larger than the first repeated value.at n=51A267471
• Number of length-7 0..n arrays with no following elements larger than the first repeated value.at n=3A267475
• a(0)=0, a(1)=1; for n>1, a(n) = n*a(n-1) - 3*a(n-2).at n=9A303224