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!)
A205396 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=ceiling(j^2/2). 2

%I #5 Mar 30 2012 18:58:11

%S 2,5,5,5,13,8,8,13,32,18,13,13,18,32,32,18,18,41,32,25,50,72,25,25,50,

%T 98,32,41,61,32,32,50,41,162,72,41,50,200,41,41,113,50,61,85,50,288,

%U 72,50,50,113,200,113,61,72,128,61,98,450,61,61,242,512,113,72

%N Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=ceiling(j^2/2).

%C For a guide to related sequences, see A204892.

%t (See the program at A205394.)

%Y Cf. A205394, A204892.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 27 2012

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 21 06:29 EDT 2024. Contains 371850 sequences. (Running on oeis4.)