|
Search: id:A086695
|
|
|
| A086695 |
|
Digits of the inverse of these numbers gives the Fibonacci numbers. More precisely the digits of 1/(10^(2*n)-10^n-1) give the Fibonacci numbers up to 10^n. |
|
+0
1
|
| |
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
More generally, if x_1,x_2, x_n=x_(n-1)-x_(n-2) is any Lucas sequence, then the digits of the numbers (x_1*10^n-(x_1-x_2))/(10^(2*n)-10^n-1) gives the x_n up to 10^n
|
|
FORMULA
|
a(n) = 10^(2*n)-10^n-1
|
|
CROSSREFS
|
Sequence in context: A020472 A093948 A116254 this_sequence A056568 A167398 A023330
Adjacent sequences: A086692 A086693 A086694 this_sequence A086696 A086697 A086698
|
|
KEYWORD
|
base,easy,full,fini,nonn
|
|
AUTHOR
|
Maurice Mischler (maurice.mischler(AT)ima.unil.ch), Sep 12 2003
|
|
|
Search completed in 0.002 seconds
|
