a(n) is the denominator of r(n) where r(n) is the sequence of rational numbers defined by the recursion: r(0) = 0, r(1) = 1 and for n>1 r(n) = r(n-1) + r(n-2)/2. From this definition it is clear that a(n) is always a power of 2 (see A060755).

A060723

a(n) is the denominator of r(n) where r(n) is the sequence of rational numbers defined by the recursion: r(0) = 0, r(1) = 1 and for n>1 r(n) = r(n-1) + r(n-2)/2. From this definition it is clear that a(n) is always a power of 2 (see A060755).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =4a(6) =4a(7) =8a(8) =1a(9) =16a(10) =16a(11) =32a(12) =8a(13) =64a(14) =64a(15) =128a(16) =8a(17) =256a(18) =256a(19) =512a(20) =128a(21) =1024a(22) =1024a(23) =2048a(24) =256a(25) =4096a(26) =4096a(27) =8192a(28) =2048a(29) =16384

External references