24014

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 80 ones.at n=29A031848
• a(0) = 1; a(n) = Sum_{0 <= k < n and gcd(k,n) = 1} a(k).at n=19A045545
• Becomes prime after exactly 8 iterations of f(x) = sum of prime factors of x.at n=4A047827
• Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=19A084276
• Expansion of (1+2*x^3)/(1-x+x^3-2*x^4).at n=38A103750
• Numbers k such that k![7]-1 is prime (where k![7] = A114799(k) = septuple factorial).at n=57A156167
• a(n) = (n^3 - 2*n^2 + 3*n + 2)/2.at n=37A189890
• A014330 - A203577. Difference between the exponential convolution of A000108 (Catalan) with itself and the corresponding exponential half-convolution.at n=8A204452
• T(n,k)=Number of arrays of n 0..k integers with no sum of consecutive elements equal to a disjoint adjacent sum of an equal number of elements.at n=62A215190
• Semiprimes sp such that sp plus its digit sum is a perfect square.at n=25A244733