94597

Properties

Appears in sequences

• a(n) = Sum_{i=0..n} digsum_8(i)^4, where digsum_8(i) = A053829(i).at n=40A231683
• Consider the Euler totient function of a number x. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach x.at n=17A269309
• Primes p such that 2*p + 31 is a square.at n=25A269786
• Lesser p of a sexy prime pair such that (p-3)/2 is also the lesser prime of a sexy prime pair.at n=37A358571
• Prime numbersat n=9124