For 1 < x, each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(0),...,c(n-1) so that 1 c(0) x^1 c(1) x^2,.., c(n-1) x^n is an integer.
A059529
For 1 < x, each c(i) is "multiply" (*) or "divide" (/); a(n) is number of choices for c(0),...,c(n-1) so that 1 c(0) x^1 c(1) x^2,.., c(n-1) x^n is an integer.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =9a(5) =16a(6) =32a(7) =68a(8) =135a(9) =256a(10) =512a(11) =1059a(12) =2110a(13) =4096a(14) =8192a(15) =16745a(16) =33425a(17) =65536a(18) =131072a(19) =266254a(20) =531924a(21) =1048576a(22) =2097152a(23) =4244214a(24) =8482454a(25) =16777216a(26) =33554432a(27) =67741466a(28) =135417620a(29) =268435456
External references
- oeis: A059529