|
Search: id:A071293
|
|
|
| A071293 |
|
a(0)=1, a(n) is the smallest integer > a(n-1) such that the continued fraction for 1/a(0)+1/a(1)+1/a(2)+...+1/a(n) contains exactly 2^n elements. |
|
+0
1
|
| |
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
The continued fraction for 1/a(0)+1/a(1)+1/5 = 1+1/2+1/5 is {1, 1, 2, 3} which contains 2^2 elements. 5 is the smallest integer > 2 with this property, hence a(2)=5.
|
|
PROGRAM
|
(PARI) s=1; t=1; for(n=1, 5, s=s+1/t; while(abs(2^n-length(contfrac(s+1/t)))>0, t++); print1(t, ", "))
|
|
CROSSREFS
|
Adjacent sequences: A071290 A071291 A071292 this_sequence A071294 A071295 A071296
Sequence in context: A107989 A069504 A101828 this_sequence A109623 A127532 A127530
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 11 2002
|
|
EXTENSIONS
|
One more term from Michel ten Voorde (seqfan(AT)tenvoorde.org) Jun 13 2003
|
|
|
Search completed in 0.002 seconds
|
