20622

Appears in sequences

• a(n) = prime(n) + n^3 + n^2 + 4n - 1.at n=26A060822
• Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.at n=25A071863
• Number of integral solutions to the equation (x_1)^3 + ... + (x_n)^3 = (x_1 + ... + x_n)^2 with 1 <= x_1 <= ... <= x_n.at n=13A158649
• Numbers that match polynomials over {0,1} that have a factor containing -3 as a coefficient; see Comments.at n=29A208182
• G.f. A(x) satisfies: x = A(x) * (1 + A(x)) * (1 - 4*A(x)).at n=5A250888
• Numbers k such that (85*10^k + 473)/9 is prime.at n=21A283513
• G.f.: Sum_{n>=0} x^n * ((1+x)^n + sqrt(3)*i)^n / (1 + sqrt(3)*i*x*(1+x)^n)^(n+1), where i^2 = -1.at n=8A323683
• Dirichlet self-convolution of the integer partition numbers A000041.at n=33A323764
• a(n) = Sum_{k=1..n} (A000330(n) mod k^2).at n=45A344711
• Triangle, read by rows, defined by recurrence: T(n,k) = T(n-1,k-1) + (-1)^k * (2 * k + 1) * T(n-1,k) for 0 < k < n with initial values T(n,0) = T(n,n) = 1 for n >= 0 and T(i,j) = 0 if j < 0 or j > i.at n=50A346083