login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134986 a(n) = smallest integer m not equal to n such that n = (floor(n^2/m) + m)/2. 2

%I

%S 2,3,2,3,4,5,5,6,7,8,9,10,10,11,12,13,14,15,16,17,17,18,19,20,21,22,

%T 23,24,25,26,26,27,28,29,30,31,32,33,34,35,36,37,37,38,39,40,41,42,43,

%U 44,45,46,47,48,49,50,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,65

%N a(n) = smallest integer m not equal to n such that n = (floor(n^2/m) + m)/2.

%C This sequence complements A000037. - _Alexander R. Povolotsky_, Feb 10 2008

%H Joshua Zucker, Feb 23 2008, <a href="/A134986/b134986.txt">Table of n, a(n) for n = 1..200</a>

%e a(1)=2 because (floor(1/2) + 2)/2 = 1.

%e a(2)=3 because (floor(4/3) + 3)/2 = 2.

%e a(3)=2 because (floor(9/2) + 2)/2 = 3.

%e a(4)=3 because (floor(16/3)+ 3))/2 = 4.

%e a(5)=4 because (floor(25/4)+ 4))/2 = 5.

%e a(6)=5 because (floor(36/5)+ 5))/2 = 6.

%e a(7)=5 because (floor(49/5)+ 5))/2 = 7.

%K nonn

%O 1,1

%A _Alexander R. Povolotsky_, Feb 05 2008; corrected Feb 07 2008 at the suggestion of _Carl R. White_

%E More terms from _Joshua Zucker_, Feb 23 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 11:10 EDT 2018. Contains 316414 sequences. (Running on oeis4.)