36080

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (1, p(1), p(2), ...).at n=23A024470
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (primes).at n=22A024478
• Duplicate of A024478.at n=22A025090
• Indices of triple-safe primes: p=prime(n) is double-safe: q=(p-1)/2, r=(q-1)/2 and s=(r-1)/2 are all prime (and q is double-safe).at n=23A075134
• a(n) = 361*n^2 - 2*n.at n=9A158307
• Number of 6-element subsets of {1, 2, ..., n} having pairwise coprime elements.at n=26A186982
• a(n) = (n+1)*(n-2)*(n-3)/2.at n=41A212343
• a(n) = 4*n*(n^2 + 2)/3.at n=30A217873
• Number of multisets of exactly six nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=9A294008
• Number of 4 X n 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=7A302083
• Numbers k such that A011772(k) > A344878(k) and A011772(k) is a divisor of A344875(k).at n=20A344595
• Numbers k, not powers of primes, for which A011772(k) divides A344875(k), and for all proper divisors d of k, A011772(d) < A011772(k).at n=10A344694
• a(n) = Sum_{k=0..n} floor(sqrt(k))^5.at n=32A363499
• Expansion of (1/x) * Series_Reversion( x * (1-x-x^4/(1-x)) ).at n=10A367317
• E.g.f. A(x) satisfies A(x) = 1 + (A(x)/x) * (exp(x^2*A(x)^2) - 1).at n=5A392956