22968

Appears in sequences

• a(n) = (n + 1)*(n + 2)*(n + 4)*(n + 8)*(n + 15)/120.at n=14A006636
• Decimal part of n^(1/11) starts with a 'nine digits' anagram.at n=9A034286
• a(n) = T(2n,n), where T(n,k) is in A037027.at n=7A038112
• Numbers n such that 83*2^n-1 is prime.at n=32A050567
• Partial sums of A000960.at n=43A099074
• a(0)=0, a(1)=1; for n >= 1, a(n+1) = (n+2)*a(n) + 2*Sum_{k=2..n-1} binomial(n, k)*a(k)*a(n-k+1).at n=6A119649
• Number of returns to the horizontal axis (both from above and below) in all weighted lattice paths in L_n.at n=12A182899
• Numbers n such that n^2 is divisible by the sum of the distinct prime divisors of n^2 + 1.at n=13A196219
• Riordan array (1/(1-x-x^2)^2, x/(1-x-x^2)^2).at n=58A238241
• a(n) = sigma(n)*pi(n^2), where sigma(n) is the sum of all (positive) divisors of n, and pi(x) is the number of primes not exceeding x.at n=45A263325
• a(n) = n*(n + 7)*(n + 14)*(n + 21)*(n + 28)/120.at n=8A264449
• Partial sums of the Jordan function J_2(k), for 1 <= k <= n.at n=43A321879
• Consider all 3 X 3 matrices M whose entries are the n-th to (n+8)-th primes prime(n), ..., prime(n+8), in any order. a(n) is the sum of the number of M such that det(M) is divisible by prime(n+i), for i from 0 to 8.at n=28A339105
• Number of compositions (ordered partitions) of n into an even number of squares.at n=33A339418
• Numbers k such that the largest unitary divisor of sigma(k) that is coprime with A003961(k) is also a unitary divisor of k.at n=53A351551