|
| |
|
|
A048860
|
|
Smallest denominator d such that the Sylvester expansion of n/d has n terms.
|
|
2
| |
|
|
1, 3, 7, 17, 31, 109, 253, 97, 271, 1621, 199, 3961, 1769, 12013, 16381, 3169, 24991, 15877, 180881, 265201, 2620801, 26753, 781219, 14473441, 693551, 55689349, 18294823
(list; graph; refs; listen; history; internal format)
|
|
|
|
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
|
|
|
PROG
| (PARI) a(n)=if(n==1, q=1, q=n+1; while(1, c=1; P=n; Q=q; while(Q%P>0, c++; D=Q\P+1; P=P*D-Q; Q*=D); if(c==n, break); q+=n)); return(q)
|
|
|
CROSSREFS
| Sequence in context: A068682 A045425 A099983 * A176690 A168582 A192958
Adjacent sequences: A048857 A048858 A048859 * A048861 A048862 A048863
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca), Jul 04 2000
|
|
|
EXTENSIONS
| a(20)-a(27) from Robert Gerbicz (robert.gerbicz(AT)gmail.com), Nov 19 2010
|
| |
|
|
