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.

A135668 a(n) = ceiling(n + sqrt(n)).

This page as a plain text file.
%I A135668 #18 Aug 26 2024 11:44:20
%S A135668 2,4,5,6,8,9,10,11,12,14,15,16,17,18,19,20,22,23,24,25,26,27,28,29,30,
%T A135668 32,33,34,35,36,37,38,39,40,41,42,44,45,46,47,48,49,50,51,52,53,54,55,
%U A135668 56,58,59,60,61,62,63,64,65,66,67
%N A135668 a(n) = ceiling(n + sqrt(n)).
%C A135668 Complement of A002061. - _Kieren MacMillan_, Dec 16 2007
%H A135668 Vincenzo Librandi, <a href="/A135668/b135668.txt">Table of n, a(n) for n = 1..1000</a>
%t A135668 Table[Ceiling[n + n^(1/2)], {n, 100}] (* _Vincenzo Librandi_, Feb 16 2013 *)
%o A135668 (Magma) [Ceiling(n + n^(1/2)): n in [1..100]]; // _Vincenzo Librandi_, Feb 16 2013
%o A135668 (Python)
%o A135668 from sympy import integer_nthroot
%o A135668 def A135668(n): return n+(a:=integer_nthroot(n,2))[0]+(not a[1]) # _Chai Wah Wu_, Aug 26 2024
%Y A135668 Cf. A134914, A135660, A135661, A135662, A135663, A135664, A135665, A028391, A002061.
%K A135668 nonn,easy
%O A135668 1,1
%A A135668 _Mohammad K. Azarian_, Nov 25 2007