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!)
A014874 Numbers k that divide s(k), where s(1)=1, s(j)=23*s(j-1)+j. 0

%I #24 Jul 03 2021 16:38:12

%S 1,11,23,121,253,1331,2783,10603,14641,29647,30613,87967,116633,

%T 161051,326117,336743,967637,1282963,1771561,2023241

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

%p # Maple code from _N. J. A. Sloane_, Jan 02 2021

%p # To test if n is a member:

%p f:=proc(n) local s,k;

%p s:=0;

%p for k from 1 to n do s:=(23*s+k) mod n; od;

%p if s=0 then 1 else -1; fi;

%p end;

%p # To compute the terms up to 10000:

%p ans:=[]; for n from 1 to 10000 do if f(n)=1 then ans:=[op(ans),n]; fi; od: ans;

%K nonn,more

%O 1,2

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

%E More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Jan 30 2001

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 25 08:25 EDT 2024. Contains 371964 sequences. (Running on oeis4.)