29267

Appears in sequences

• Fibonacci sequence beginning 0, 7.at n=19A022090
• Triangle, read by rows, of the coefficients of [x^k] in G100231(x)^n such that the row sums are 5^n-1 for n>0, where G100231(x) is the g.f. of A100231.at n=34A100232
• Sums of two or more distinct 4th powers of primes.at n=31A130833
• Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 10, read by rows.at n=29A153655
• Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 10, read by rows.at n=34A153655
• Expansion of (1 + x + x^2)/(1 - x^2 - 2*x^3).at n=25A159288
• Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals six.at n=12A288545