For each prime P consider the generalized Collatz sequence of each integer N > 1 defined by c(0) = N, c(m+1) = c(m) * P + 1 if F > P, else c(m+1) = c(m) / F, where F is the smallest factor of c(m), until the sequence cycles. If all c(i) > 1 for some starting number N then P belongs to the sequence (and vice versa).
A058048
For each prime P consider the generalized Collatz sequence of each integer N > 1 defined by c(0) = N, c(m+1) = c(m) * P + 1 if F > P, else c(m+1) = c(m) / F, where F is the smallest factor of c(m), until the sequence cycles. If all c(i) > 1 for some starting number N then P belongs to the sequence (and vice versa).
Terms
- a(0) =2a(1) =11a(2) =13a(3) =17a(4) =19a(5) =23a(6) =31a(7) =37a(8) =43a(9) =47a(10) =53a(11) =59a(12) =61a(13) =67a(14) =71a(15) =73a(16) =83a(17) =97a(18) =101a(19) =103a(20) =113a(21) =131a(22) =137a(23) =139a(24) =151a(25) =163a(26) =167a(27) =173a(28) =181a(29) =193
External references
- oeis: A058048