login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A134986
a(n) = smallest integer m not equal to n such that n = (floor(n^2/m) + m)/2.
2
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, 23, 24, 25, 26, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 65
OFFSET
1,1
COMMENTS
This sequence complements A000037. - Alexander R. Povolotsky, Feb 10 2008
LINKS
Joshua Zucker, Feb 23 2008, Table of n, a(n) for n = 1..200
EXAMPLE
a(1)=2 because (floor(1/2) + 2)/2 = 1.
a(2)=3 because (floor(4/3) + 3)/2 = 2.
a(3)=2 because (floor(9/2) + 2)/2 = 3.
a(4)=3 because (floor(16/3) + 3)/2 = 4.
a(5)=4 because (floor(25/4) + 4)/2 = 5.
a(6)=5 because (floor(36/5) + 5)/2 = 6.
a(7)=5 because (floor(49/5) + 5)/2 = 7.
CROSSREFS
Cf. A000037.
Sequence in context: A187180 A256992 A261323 * A336860 A216209 A289172
KEYWORD
nonn
AUTHOR
Alexander R. Povolotsky, Feb 05 2008; corrected Feb 07 2008 at the suggestion of Carl R. White
EXTENSIONS
More terms from Joshua Zucker, Feb 23 2008
STATUS
approved