login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098853 Consider the smallest denominator q such that the Sylvester expansion of n/q has n terms. Here q has the form q = k*n+1 and we set a(n) = k. 2
0, 1, 2, 4, 6, 18, 36, 12, 30, 162, 18, 330, 136, 858, 1092, 198, 1470, 882, 9520, 13260, 124800, 1216, 33966, 603060, 27742, 2141898, 677586 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Matthijs Coster, Some sequences.
FORMULA
a(n) = (A048860(n)-1)/n.
EXAMPLE
a(5)=6 because 5*6+1 = 31 and 5/31 = 1/7 + 1/55 + 1/3979 + 1/23744683 + 1/1127619917796295.
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-1)/n)
CROSSREFS
Cf. A048860.
Sequence in context: A073664 A088174 A052930 * A023149 A085146 A066894
KEYWORD
nonn,more
AUTHOR
Matthijs Coster, Oct 11 2004
EXTENSIONS
Two more terms computed from A048860 by Max Alekseyev, Mar 08 2010
a(20)-a(27) from Robert Gerbicz, Nov 19 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 12:57 EST 2023. Contains 367690 sequences. (Running on oeis4.)