60647

Properties

Appears in sequences

• Primes prime(k) for which A049076(k) = 4.at n=22A049080
• Primes for which A049076 >= 4.at n=33A049090
• Omit the 1's from Rowland's sequence f(n) - f(n-1) = gcd(n,f(n-1)), where f(1) = 7.at n=39A137613
• a(n) = 42*n^2 - 1.at n=37A158626
• Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_(n+1) = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number.at n=39A190894
• Auxiliary r(n) sequence used to prove some properties about Rowland's sequence: r(1) = 1, and r(n) = 1/2*(c(n)+1), where c(n) is A190894, for n>1.at n=40A190895
• Records in A132199.at n=14A191304
• New primes found by Rowland's recurrence in the order of their appearance.at n=17A221869
• Smallest lesser of twin primes (A001359) with index n, or a(n)=0, if there are no such twin primes.at n=31A242807
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 241", based on the 5-celled von Neumann neighborhood.at n=32A287096
• Prime numbers with prime indices in A333243.at n=25A333244
• a(n) is the multiplicative inverse of A008514(n+1) modulo A008514(n).at n=16A334137
• Primes having only {0, 4, 6, 7} as digits.at n=24A386072
• Prime numbersat n=6113