Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.
A094658
Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.
Terms
- a(0) =1a(1) =48a(2) =28a(3) =6a(4) =9a(5) =4a(6) =33a(7) =30a(8) =22a(9) =54a(10) =8a(11) =26a(12) =21a(13) =112a(14) =92a(15) =80a(16) =27a(17) =64a(18) =972a(19) =878a(20) =805a(21) =669a(22) =576a(23) =484a(24) =377a(25) =291a(26) =253a(27) =1629a(28) =6591a(29) =6474
External references
- oeis: A094658