|
%I #15 Mar 25 2015 01:49:09
%S 3,2,3,4,3,4,3,4,5,4,5,4,5,4,5,6,5,6,5,6,5,6,5,6,7,6,7,6,7,6,7,6,7,6,
%T 7,8,7,8,7,8,7,8,7,8,7,8,7,8,9,8,9,8,9,8,9,8,9,8,9,8,9,8,9,10,9,10,9,
%U 10,9,10,9,10,9,10,9,10,9,10,9,10,11,10,11,10,11,10,11,10,11,10,11,10,11,10,11,10,11,10,11,12
%N a(n) = sqrt(n + 2*A256243(n)).
%H Charles R Greathouse IV, <a href="/A256244/b256244.txt">Table of n, a(n) for n = 1..10000</a>
%F sqrt(n) < a(n) <= sqrt(n) + 2. - _Charles R Greathouse IV_, Mar 23 2015
%t Table[m = 1; While[! IntegerQ[Sqrt[n + 2*m]], m++]; Sqrt[n + 2 m], {n, 100}] (* _Michael De Vlieger_, Mar 20 2015 *)
%o (PARI) a(n)=m=1;while(!issquare(n+2*m),m++);sqrt(n+2*m)
%o vector(100,n,round(a(n))) \\ _Derek Orr_, Mar 22 2015
%o (PARI) a(n)=my(s=sqrtint(n)); if((s-n)%2,s+1,s+2) \\ _Charles R Greathouse IV_, Mar 23 2015
%Y Cf. A000196, A256243.
%K nonn,easy
%O 1,1
%A _Zak Seidov_, Mar 20 2015
|
