Define f(1) = 0. For n>=2, let f(n) = n - p where p is the largest prime <= n. a(n) = number of iterations of f to reach 0, starting from n.
A072491
Define f(1) = 0. For n>=2, let f(n) = n - p where p is the largest prime <= n. a(n) = number of iterations of f to reach 0, starting from n.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =2a(7) =1a(8) =2a(9) =2a(10) =2a(11) =1a(12) =2a(13) =1a(14) =2a(15) =2a(16) =2a(17) =1a(18) =2a(19) =1a(20) =2a(21) =2a(22) =2a(23) =1a(24) =2a(25) =2a(26) =2a(27) =3a(28) =2a(29) =1
External references
- oeis: A072491