A piecewise recurrence relation with a(2)=7 and for n>=2: if a(n) is prime, not 31, a(n+1) = A000265(3*a(n)+1); if a(n) is odd composite, not 1, a(n+1) = A000265(a(n)+1); if a(n) is even, a(n+1) = A000265(a(n)); if a(n) is 1 or 31, find the number S(n) of occurrences of 1 and 31 among a(2),a(3),...,a(n) and compute a(n+1) by the above rules as if a(n) were 2+S(n), unless 2+S(n)=31, in which case a(n+1)=47.
A086762
A piecewise recurrence relation with a(2)=7 and for n>=2: if a(n) is prime, not 31, a(n+1) = A000265(3*a(n)+1); if a(n) is odd composite, not 1, a(n+1) = A000265(a(n)+1); if a(n) is even, a(n+1) = A000265(a(n)); if a(n) is 1 or 31, find the number S(n) of occurrences of 1 and 31 among a(2),a(3),...,a(n) and compute a(n+1) by the above rules as if a(n) were 2+S(n), unless 2+S(n)=31, in which case a(n+1)=47.
Terms
- a(0) =7a(1) =11a(2) =17a(3) =13a(4) =5a(5) =1a(6) =5a(7) =1a(8) =1a(9) =1a(10) =3a(11) =5a(12) =1a(13) =11a(14) =17a(15) =13a(16) =5a(17) =1a(18) =1a(19) =5a(20) =1a(21) =5a(22) =1a(23) =17a(24) =13a(25) =5a(26) =1a(27) =3a(28) =5a(29) =1
External references
- oeis: A086762