24048

Appears in sequences

• Number of compositions of n into a sum of odd primes.at n=45A002124
• Sum of all partitions of n into distinct parts.at n=36A066189
• Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.at n=38A073603
• 10000 times the n-th zero of the BesselJ function of zero order, rounded.at n=0A084691
• Sum of first n zeros of BesselJ function of zero order.at n=0A084692
• a(n) = 24*p(n) = 24*A000041(n).at n=22A183008
• Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding four.at n=30A189325
• a(n) where a(n) * a(n-5) * a(n-10) = a(n-1) * a(n-6) * a(n-8) + a(n-2) * a(n-4) * a(n-9), with a(1) = ... = a(10) = 1.at n=23A205303
• Smallest number k such that R(n) is the n-th divisor of k, where R(n) is the n-th Ramanujan prime (A104272).at n=14A233933
• Number of (1+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=11A250878
• Numbers k such that 3*R_k + 20 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=15A256463
• Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) / Product_{j>=1} (1 - x^j), where mu() is the Moebius function (A008683).at n=26A281573
• Regular triangle read by rows: T(n,k) is the number of multiset partitions of normal multisets of size n into k blocks, where a multiset is normal if it spans an initial interval of positive integers.at n=42A317532