43983

Appears in sequences

• [ exp(2/23)*n! ].at n=7A030827
• Scan decimal expansion of zeta(3) until all n-digit strings have been seen; a(n) is last string seen.at n=4A036902
• Numbers n such that n*359# +-1 are twin primes, where 359# = 72nd primorial (A002110(72)).at n=33A087907
• 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, 0, 0), (0, 0, 1), (1, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=8A150614
• Number of (n+1)X(n+1) 0..1 arrays with no element having a strict majority of its horizontal and vertical neighbors equal to one.at n=3A231970
• Number of (n+1)X(4+1) 0..1 arrays with no element having a strict majority of its horizontal and vertical neighbors equal to one.at n=3A231973
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element having a strict majority of its horizontal and vertical neighbors equal to one.at n=24A231977
• Number of (n+2)X(n+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=23A254899
• a(n) is the smallest positive integer k such that the base-n representation of 2^k has a pandigital ending of length n, or 0 if no such k exists.at n=11A348209
• a(n) = Sum_{k=0..floor(n/3)} binomial(3*k,2*n-6*k).at n=22A392435