Each c(i) is "multiply" (*) or "divide" (/). a(n) is number of choices for c(1), ..., c(n-1) so that 1 c(1) 2 c(2) 3,.., c(n-1) n is an integer.
A058524
Each c(i) is "multiply" (*) or "divide" (/). a(n) is number of choices for c(1), ..., c(n-1) so that 1 c(1) 2 c(2) 3,.., c(n-1) n is an integer.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =2a(5) =8a(6) =8a(7) =13a(8) =21a(9) =77a(10) =77a(11) =128a(12) =128a(13) =354a(14) =641a(15) =1232a(16) =1232a(17) =2677a(18) =2677a(19) =7220a(20) =8951a(21) =25378a(22) =25378a(23) =63680a(24) =113335a(25) =323151a(26) =532358a(27) =1442702a(28) =1442702a(29) =2963955
External references
- oeis: A058524