100512

Appears in sequences

• Length of list generated by n replacements of k by {-1-|k|, ..., 1+|k|} with increment 2, starting with {0}.at n=9A083691
• Numbers k such that k^2 + 1 is divisible by precisely four distinct primes where the sum of the largest and the smallest is equal to the sum of the other two.at n=7A192770
• Numbers k such that the sum of the largest and the smallest prime divisor of k^2 + 1 equals the sum of the other distinct prime divisors.at n=16A199924
• Numbers n > 1 such that the sum of the distinct prime divisors of n^2 + 1 that are congruent to 1 mod 8 equals the sum of the distinct prime divisors congruent to 5 mod 8.at n=10A215950
• Number of (n+2)X(n+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 3, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=2A253334
• Number of (n+2)X(3+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 3, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=2A253337
• T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 3, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=12A253342
• a(n) = Sum_{k=0..n} (-1)^k * binomial(n+k-1,n-k) * Fibonacci(k+1).at n=18A390850