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!)
 A014861 Numbers k that divide s(k), where s(1)=1, s(j)=13*s(j-1)+j. 0
 1, 3, 9, 13, 27, 39, 81, 117, 183, 243, 351, 549, 689, 729, 1053, 1647, 2067, 2187, 2379, 3081, 3159, 4941, 6201, 6561, 7137, 9243, 9477, 11163, 14823, 18603, 19683, 21411, 27729, 28431, 33489, 36517, 42627, 44469, 55809, 59049, 64233, 67161, 73723, 83187, 85293 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS PROG (PARI) lista(nn) = my(s); for(k=1, nn, s=13*s+k; if(s%k==0, print1(k, ", "))); \\ Jinyuan Wang, Aug 08 2021 CROSSREFS s(n) = A014896(n). Sequence in context: A074938 A057260 A107364 * A018407 A304350 A305913 Adjacent sequences: A014858 A014859 A014860 * A014862 A014863 A014864 KEYWORD nonn AUTHOR EXTENSIONS 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 2 14:15 EST 2022. Contains 358510 sequences. (Running on oeis4.)