22954

Appears in sequences

• a(n) = prime(n) + n^3 + n^2 + 4n - 1.at n=27A060822
• Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive).at n=29A074814
• a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + sum of the unique prime factors of a(n).at n=32A096460
• Number of unrooted Eulerian n-edge maps in the plane (planar with a distinguished outside face).at n=8A103939
• Matrix inverse, read by rows, of triangle A104029, which forms the pairwise sums of trinomial coefficients.at n=23A104030
• Consider the smallest k such that prime(k) > n*composite(k). Sequence gives composite(k).at n=9A125075
• Numbers of ways in which a unit disc can be dissected into 6n curvilinear triangles, at least one of which does not contain the center.at n=30A193362
• G.f.: Sum_{n>=1} x^n / (1-x)^prime(n).at n=10A227235
• a(n) = Sum_{k=1..floor(n/2)} k * (n-k) * floor((n-k)/k).at n=44A339804