28402

Appears in sequences

• Number of Dyck paths of knight moves.at n=15A005221
• a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=43A024598
• a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor(n/2), s = (odd natural numbers).at n=42A025112
• Number of partitions of n with more even parts than odd parts.at n=46A108949
• n times pi(n) is a palindrome, where pi(n) = PrimePi(n) = A000720(n).at n=31A116054
• a(n) = n*(8*n^2 + 1)/3.at n=22A143166
• Let P(n) = primorial(n) = A002110(n); a(n) is the number of primes q < P(n) such that P(n) - q is also prime and q^2==1 (mod P(n)).at n=21A336093