|
Search: id:A048860
|
|
|
| A048860 |
|
Smallest denominator d such that the Sylvester expansion of n/d has n terms. |
|
+0
2
|
|
| 1, 3, 7, 17, 31, 109, 253, 97, 271, 1621, 199, 3961, 1769, 12013, 16381, 3169, 24991, 15877, 180881
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
H. T. Freitag and G. M. Phillips, Sylvester's algorithm and Fibonacci numbers, in Applications of Fibonacci numbers, Vol. 8 (Rochester, NY, 1998), 155-163, Kluwer Acad. Publ., Dordrecht, 1999.
|
|
EXAMPLE
|
a(3) = 7 since 3/7 = 1/3 + 1/11 + 1/231
|
|
CROSSREFS
|
Sequence in context: A068682 A045425 A099983 this_sequence A034482 A114100 A014395
Adjacent sequences: A048857 A048858 A048859 this_sequence A048861 A048862 A048863
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca), Jul 04 2000
|
|
|
Search completed in 0.002 seconds
|
