19862
domain: N
Appears in sequences
- a(n) = floor(n*phi^16), where phi is the golden ratio, A001622.at n=9A004931
- Number of ordered pairs of partitions of n with no common parts.at n=18A054440
- Transform of A059226 applied to sequence 0, 1, 0, 0, 0, 0, ...at n=7A059271
- f-amicable numbers where f(n) = n+1.at n=7A066505
- a(n) = (A114043(n) - 1)/2.at n=18A115005
- Even semiprime equivalent to the Euclid-Mullin sequence: a(1) = 4, a(n) = smallest semiprime divisor of product of previous terms plus 2.at n=37A193689
- Numbers k such that 3*10^k + 97 is prime.at n=18A295401
- Number of partitions of n that contain {1,2} minus number of partitions of n that contain neither 1 nor 2.at n=40A324368
- a(n) = Sum_{k=0..n} phi(k^2 + 1), where phi is the Euler totient function (A000010).at n=44A333170
- Number of integer partitions of n with fewer parts than distinct divisors of parts.at n=51A371173