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.

A175627 a(1) = 1; a(n) is the smallest square > 2*a(n-1).

This page as a plain text file.
%I A175627 #17 Jul 26 2017 19:20:38
%S A175627 1,4,9,25,64,144,289,625,1296,2601,5329,10816,21904,44100,88209,
%T A175627 177241,355216,710649,1423249,2849344,5702544,11410884,22829284,
%U A175627 45670564,91355364,182736324,365497924,730999369,1462068169,2924213776,5848578576,11697287716,23394620209,46789583481
%N A175627 a(1) = 1; a(n) is the smallest square > 2*a(n-1).
%H A175627 Harvey P. Dale, <a href="/A175627/b175627.txt">Table of n, a(n) for n = 1..1000</a>
%F A175627 a(n) = (ceiling(sqrt(2*a(n-1))))^2.
%F A175627 lim_{n->oo} (a(n+1)/a(n)) = 2.
%t A175627 NestList[(Floor[Sqrt[2#]]+1)^2&,1,40] (* _Harvey P. Dale_, Jul 26 2017 *)
%o A175627 (PARI) {a=1; print1(a, ", "); for(i=1, 40, a=(ceil(sqrt(2*a)))^2; print1(a, ", "))} /* _Zak Seidov_, Dec 04 2010 */
%Y A175627 Cf. A055496.
%K A175627 nonn,easy
%O A175627 1,2
%A A175627 _Ctibor O. Zizka_, Dec 04 2010