The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A139717 If k is the smallest divisor of n that is >= sqrt(n) then a(n) = k^2 - n. 2

%I #13 May 20 2015 19:55:37

%S 0,2,6,0,20,3,42,8,0,15,110,4,156,35,10,0,272,18,342,5,28,99,506,12,0,

%T 143,54,21,812,6,930,32,88,255,14,0,1332,323,130,24,1640,7,1806,77,36,

%U 483,2162,16,0,50,238,117,2756,27,66,8,304,783,3422,40,3660,899,18,0

%N If k is the smallest divisor of n that is >= sqrt(n) then a(n) = k^2 - n.

%C a(p) = p*(p-1) for all primes p. a(n^2) = 0 for all positive integers n.

%H Ivan Neretin, <a href="/A139717/b139717.txt">Table of n, a(n) for n = 1..10000</a>

%t f[n_]:=Module[{m=First[Select[Divisors[n],#>=Sqrt[n]&]]}, m^2-n]; Array[f,65] (* _Harvey P. Dale_, Apr 02 2011 *)

%Y Cf. A139716, A033677.

%K nonn

%O 1,2

%A _Leroy Quet_, May 01 2008

%E Extended by _Ray Chandler_, Jul 01 2009

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 June 6 08:15 EDT 2024. Contains 373115 sequences. (Running on oeis4.)