20437

Appears in sequences

• Number of unrooted self-avoiding walks of n steps on square lattice.at n=11A037245
• Number of primes less than 10000n.at n=22A038813
• Smallest k not a palindrome and not divisible by 10 such that k and R(k) (A004086) both are divisible by the n-th prime.at n=27A075605
• a(n) = smallest M such that M is not divisible by prime(1), ..., prime(n), but is divisible by Sum_{i=1..n} (M mod prime(i)); or 0 if no such M exists.at n=15A106572
• The largest number m such that sigma(m) = A007368(n), where A007368(n) = the smallest k such that sigma(x) = k has exactly n solutions.at n=38A184394
• Number of -2..2 arrays x(0..n-1) of n elements with zero sum, and adjacent elements not both strictly positive and not both strictly negative.at n=8A199892
• T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum, and adjacent elements not both strictly positive and not both strictly negative.at n=53A199898
• Numbers n such that there is an integer k with the property that k^tau(n) = sigma(n).at n=17A225239
• Number of partitions p of n such that m(p) < m(c(p)), where m = maximal multiplicity of parts, and c = conjugate.at n=40A240726
• Number of (n+2)X(1+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=8A252688
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=36A252695
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=44A252695
• Numbers k such that (68*10^k - 257)/9 is prime.at n=21A288149
• Expansion of (1/(1 - x))*Product_{k>=1} (1 - x^prime(k))/(1 - x^k).at n=47A303663
• Number of meanders of length n with Motzkin-steps avoiding the consecutive steps UU.at n=12A329672
• a(n) = Sum_{i=1..n+1} prime(i)*Sum_{j=0..i-1} binomial(n,j).at n=8A343414