24115

Appears in sequences

• Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) = cn(2,5) = cn(3,5).at n=15A036892
• Indices of prime Lucas 5-step numbers, A074048.at n=23A105764
• An alternating 2-based sum from prime(n) up to the base of the n-th Mersenne prime.at n=20A162848
• Number of n X 4 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the sum of elements above it, modulo 3.at n=7A238808
• T(n,k)=Number of nXk 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the elements above it, modulo 3.at n=58A238812
• G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies: [Sum_{n>=0} x^n/(1 - x^(n+1))]^3 = Sum_{n>=0} a(n)*x^n/(1 - x^(n+1))^3.at n=36A341374
• a(n) = Sum_{d|n} sigma(d)^3.at n=11A344044
• Terms of A349937 that are not divisible by 3: numbers k > 1 not divisible by 2 or 3 such that A309906(k-1) < A309906(k) > A309906(k+1).at n=11A349941
• Number of compositions of n such that the set of absolute differences is a subset of the set of parts.at n=21A368557
• Tetraprimes (or products of exactly four distinct prime numbers) that are the sum of two successive tetraprimes.at n=6A380348
• Expansion of e.g.f. (1/x) * Series_Reversion( x * exp(-arcsin(x)) ).at n=6A385426