22590

Appears in sequences

• a(n) = Sum_{k=0..n} T(n,k), where T is the array defined in A025177.at n=10A025191
• Triangle, read by rows, equal to the matrix square of A113983.at n=49A113988
• E.g.f. A(x) satisfies: A(x) = 1 + x*exp(Integral A(x)^4 dx).at n=6A143924
• Triangle T(n,k) with the coefficient [x^k] of 1/(1-2*x-x^2+x^3)^(n-k+1) in row n, column k.at n=61A188106
• (1/2)*A206803.at n=37A206804
• 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=39A263325
• Numbers m such that 72*m + 1, 576*m + 1, 648*m + 1, 1296*m + 1, and 2592*m + 1 are all primes.at n=8A372187
• Number T(n,k) of partitions of [n] having exactly k blocks of minimal size; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=58A372762