|
Search: id:A060723
|
|
|
| A060723 |
|
a(n) is the denominator of b(n) where b(n) is a sequence of rational numbers defined by the recursion: b(0) = 0, b(1) = 1 and for n>1 b(n) = b(n-1) + b(n-2)/2 . By this definition it is clear that a(n) is always a power of 2 (see A060755). |
|
+0
2
|
|
| 1, 1, 1, 2, 1, 4, 4, 8, 1, 16, 16, 32, 8, 64, 64, 128, 8, 256, 256, 512, 128, 1024, 1024, 2048, 256, 4096, 4096, 8192, 2048, 16384, 16384, 32768, 1024, 65536, 65536, 131072, 32768, 262144, 262144, 524288, 65536, 1048576, 1048576, 2097152
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
EXAMPLE
|
The sequence b(n) begins 0, 1, 1, 3/2, 2, 11/4, 15/4, 41/8, 7, 153/16, 209/16, 571/32, 363/16, 2023/64, 2749/64, 7521/128, 5135/64, ... It can be proved that b(n) is an integer (i.e. a(n) = 1) iff n is one of 0, 1, 2, 4, 8.
|
|
CROSSREFS
|
Cf. A060755.
Sequence in context: A077965 A077967 A008312 this_sequence A074763 A099932 A008346
Adjacent sequences: A060720 A060721 A060722 this_sequence A060724 A060725 A060726
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Avi Peretz (njk(AT)netvision.net.il), Apr 21 2001
|
|
EXTENSIONS
|
More terms from Vladeta B. Jovovic (vladeta(AT)eunet.rs), Apr 24 2001
|
|
|
Search completed in 0.002 seconds
|
