25197

Appears in sequences

• Triangle T(n,k) giving the largest member of "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k.at n=24A230429
• Number of acute triangles, distinct up to congruence, on a centered hexagonal grid of size n.at n=16A241232
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 5 6 or 7.at n=4A252508
• Number of (n+2)X(5+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 5 6 or 7.at n=1A252511
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 5 6 or 7.at n=16A252514
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 5 6 or 7.at n=19A252514
• Numbers n with the property that n^2 contains a sequence of four or more consecutive 8's.at n=13A301938
• Integers m such that sigma(m) + sigma(m+1) + sigma(m+2) - sigma(m+3) <= 0, where sigma is the sum of divisors.at n=3A348698
• Nonprime numbers k of the form 4*m+1 such that Sum_{j=0..k-1} 2^j * binomial(3*j, j) == 1 (mod k).at n=39A373747
• a(n) = Sum_{k=0..n} binomial(4*n+2*k,n-k).at n=5A390408