Each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(1),..,c(n) so that the reduced fraction 1 c(1) 2 c(2) 3 c(3) 5 ... c(n) prime(n) is equal to (k*m+1)/m for a positive integer m and a nonnegative integer k.

A059583

Each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(1),..,c(n) so that the reduced fraction 1 c(1) 2 c(2) 3 c(3) 5 ... c(n) prime(n) is equal to (k*m+1)/m for a positive integer m and a nonnegative integer k.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =5a(4) =6a(5) =6a(6) =6a(7) =3a(8) =5a(9) =6a(10) =7a(11) =9a(12) =8a(13) =7a(14) =7a(15) =9a(16) =6a(17) =8a(18) =6a(19) =9a(20) =6a(21) =8a(22) =9a(23) =12a(24) =11a(25) =5a(26) =9a(27) =8a(28) =7a(29) =7

External references