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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014858 Numbers k that divide s(k), where s(1)=1, s(j)=11*s(j-1)+j. 0
 1, 5, 11, 25, 55, 125, 275, 625, 1375, 3125, 6875, 15625, 16105, 34375, 75025, 78125, 80525, 171875, 173767, 177155, 375125, 390625, 402625, 603775, 825275, 859375, 868835, 885775, 1391555, 1875625, 1953125, 2013125, 2153855, 3018875, 4126375, 4296875, 4344175 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MATHEMATICA nxt[{n_, s_}]:={n+1, 11s+n+1}; Transpose[Select[NestList[nxt, {1, 1}, 3000000], Divisible[Last[#], First[#]]&]][[1]] (* Harvey P. Dale, Aug 21 2013 *) PROG (PARI) lista(nn) = my(s); for(k=1, nn, s=11*s+k; if(s%k==0, print1(k, ", "))); \\ Jinyuan Wang, Aug 08 2021 CROSSREFS s(n) = A014881(n). Sequence in context: A337481 A056739 A003598 * A355243 A018368 A050344 Adjacent sequences: A014855 A014856 A014857 * A014859 A014860 A014861 KEYWORD nonn AUTHOR EXTENSIONS More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Jan 30 2001 More terms from Jinyuan Wang, Aug 08 2021 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.

Last modified December 6 17:53 EST 2022. Contains 358644 sequences. (Running on oeis4.)