cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A256244 a(n) = sqrt(n + 2*A256243(n)).

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