69037

Appears in sequences

• Number of zero-sum -1..1 arrays of n elements with first through third differences also in -1..1.at n=33A202504
• Odd numbers n containing 65536 as the highest power of 2 in their Collatz (3x+1) iteration.at n=17A247716
• Numbers k for which phi(A267099(k)) is equal to phi(k), but the number of 4m+1 and 4m+3 primes in the prime factorization of k (when counted with multiplicity) is not equal. Here A267099 is fully multiplicative involution swapping the positions of 4m+1 and 4m+3 primes, and phi is Euler totient function.at n=0A354194