31603

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 29 ones.at n=15A031797
• (Terms in A029661)/2.at n=39A051430
• (Terms in A029647)/2.at n=45A051471
• Sum of primes dividing n^n+1 (with repetition).at n=9A064772
• a(n) = prime(n-2)*prime(n-1)^2*prime(n).at n=4A066116
• Triangle read by rows: T(n,k) = T(n-1,k-1)*T(n,k-1) and T(n,1) = prime(n).at n=23A066117
• Let C(n) = product of composite numbers between the n-th prime and (n+1)-th prime; a(n) = floor(C(n+1)/C(n)).at n=36A073836
• Numbers k such that k + (largest digit of k)! is a palindromic prime.at n=16A095920
• Sums of two or more distinct 4th powers of primes.at n=38A130833
• a(n) = n*(n+1)*(5*n + 4)/6.at n=33A162147
• Number of partitions of n into parts <= phi(n), where phi is Euler's totient function (cf. A000010).at n=40A227296
• Irregular triangle read by rows: T(n,k) = number of unsigned unichromosonal genomes with n genes at 3-break distance k from a fixed genome, 0 <= k <= floor(n/2).at n=50A264614
• For any number n > 0, let f(n) be the polynomial of a single indeterminate x where the coefficient of x^e is the prime(1+e)-adic valuation of n (where prime(k) denotes the k-th prime); f establishes a bijection between the positive numbers and the polynomials of a single indeterminate x with nonnegative integer coefficients; let g be the inverse of f; a(n) = g(f(n)^2).at n=34A297473
• Sequence used for the Boas-Buck type recurrence for Riordan triangle A319203.at n=13A319204
• 4-brilliant numbers: numbers which are the product of four primes having the same number of decimal digits.at n=45A376704