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

 

Logo
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

%I #16 Aug 08 2021 11:34:01

%S 1,3,9,13,27,39,81,117,183,243,351,549,689,729,1053,1647,2067,2187,

%T 2379,3081,3159,4941,6201,6561,7137,9243,9477,11163,14823,18603,19683,

%U 21411,27729,28431,33489,36517,42627,44469,55809,59049,64233,67161,73723,83187,85293

%N Numbers k that divide s(k), where s(1)=1, s(j)=13*s(j-1)+j.

%o (PARI) lista(nn) = my(s); for(k=1, nn, s=13*s+k; if(s%k==0, print1(k, ", "))); \\ _Jinyuan Wang_, Aug 08 2021

%Y s(n) = A014896(n).

%K nonn

%O 1,2

%A _N. J. A. Sloane_, _Olivier GĂ©rard_

%E More terms from _Jinyuan Wang_, Aug 08 2021

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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)