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.
%I A001650 #41 Nov 24 2024 01:49:37
%S A001650 1,3,3,3,5,5,5,5,5,7,7,7,7,7,7,7,9,9,9,9,9,9,9,9,9,11,11,11,11,11,11,
%T A001650 11,11,11,11,11,13,13,13,13,13,13,13,13,13,13,13,13,13,15,15,15,15,15,
%U A001650 15,15,15,15,15,15,15,15,15,15,17,17,17,17,17,17,17,17,17,17,17,17,17
%N A001650 k appears k times (k odd).
%C A001650 For n >= 0, a(n+1) is the number of integers x with |x| <= sqrt(n), or equivalently the number of points in the Z^1 lattice of norm <= n+1. - _David W. Wilson_, Oct 22 2006
%C A001650 The burning number of a connected graph of order n is at most a(n). See Bessy et al. - _Michel Marcus_, Jun 18 2018
%D A001650 J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 106.
%H A001650 T. D. Noe, <a href="/A001650/b001650.txt">Table of n, a(n) for n = 1..10000</a>
%H A001650 Stéphane Bessy, Anthony Bonato, Jeannette Janssen and Dieter Rautenbach, <a href="https://arxiv.org/abs/1511.06023">Bounds on the Burning Number</a>, arXiv:1511.06023 [math.CO], 2015-2016.
%H A001650 Abraham Isgur, Vitaly Kuznetsov, and Stephen Tanny, <a href="https://arxiv.org/abs/1202.0276">A combinatorial approach for solving certain nested recursions with non-slow solutions</a>, arXiv preprint arXiv:1202.0276 [math.CO], 2012.
%F A001650 a(n) = 1 + 2*floor(sqrt(n-1)), n > 0. - _Antonio Esposito_, Jan 21 2002
%F A001650 From _Michael Somos_, Apr 29 2003: (Start)
%F A001650 G.f.: theta_3(x)*x/(1-x).
%F A001650 a(n+1) = a(n) + A000122(n). (End)
%F A001650 a(1) = 1, a(2) = 3, a(3) = 3, a(n) = a(n-a(n-2))+2. - _Branko Curgus_, May 07 2010
%F A001650 a(n) = 2*ceiling(sqrt(n)) - 1. - _Branko Curgus_, May 07 2010
%F A001650 Seen as a triangle read by rows: T(n,k) = 2*(n-1), k=1..n. - _Reinhard Zumkeller_, Nov 14 2015
%F A001650 Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/4 (A003881). - _Amiram Eldar_, Oct 01 2022
%t A001650 a[1]=1,a[2]=3,a[3]=3,a[n_]:=a[n]=a[n-a[n-2]]+2 (* _Branko Curgus_, May 07 2010 *)
%t A001650 Flatten[Table[Table[n,{n}],{n,1,17,2}]] (* _Harvey P. Dale_, Mar 31 2013 *)
%o A001650 (PARI) a(n)=if(n<1,0,1+2*sqrtint(n-1))
%o A001650 (Haskell)
%o A001650 a001650 n k = a001650_tabf !! (n-1) !! (k-1)
%o A001650 a001650_row n = a001650_tabf !! (n-1)
%o A001650 a001650_tabf = iterate (\xs@(x:_) -> map (+ 2) (x:x:xs)) [1]
%o A001650 a001650_list = concat a001650_tabf
%o A001650 -- _Reinhard Zumkeller_, Nov 14 2015
%o A001650 (Python)
%o A001650 from math import isqrt
%o A001650 def A001650(n): return 1+(isqrt(n-1)<<1) # _Chai Wah Wu_, Nov 23 2024
%Y A001650 Partial sums of A000122.
%Y A001650 Cf. A001670, A003881, A111650, A131507, A193832.
%K A001650 nonn,easy
%O A001650 1,2
%A A001650 _N. J. A. Sloane_
%E A001650 More terms from _Michael Somos_, Apr 29 2003