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 A079496 #124 Jul 10 2025 10:45:30
%S A079496 1,1,3,5,17,29,99,169,577,985,3363,5741,19601,33461,114243,195025,
%T A079496 665857,1136689,3880899,6625109,22619537,38613965,131836323,225058681,
%U A079496 768398401,1311738121,4478554083,7645370045,26102926097,44560482149,152139002499,259717522849,886731088897
%N A079496 a(0) = a(1) = 1; thereafter a(2*n+1) = 2*a(2*n) - a(2*n-1), a(2*n) = 4*a(2*n-1) - a(2*n-2).
%C A079496 a(1)=1, a(n) is the smallest integer > a(n-1) such that sqrt(2)*a(n) is closer and > to an integer than sqrt(2)*a(n-1) (i.e., a(n) is the smallest integer > a(n-1) such that frac(sqrt(2)*a(n)) < frac(sqrt(2)*a(n-1))).
%C A079496 n such that floor(sqrt(2)*n^2) = n*floor(sqrt(2)*n).
%C A079496 The sequence 1,1,3,5,17,... has g.f. (1+x-3x^2-x^3)/(1-6x^2+x^4); a(n) = Sum_{k=0..floor(n/2)} C(n,2k)*2^(n-k-floor((n+1)/2)); a(n) = -(sqrt(2)-1)^n*((sqrt(2)/8-1/4)*(-1)^n - sqrt(2)/8 - 1/4) - (sqrt(2)+1)^n*((sqrt(2)/8-1/4)*(-1)^n - sqrt(2)/8 - 1/4); a(2n) = A001541(n) = A001333(2n); a(2n+1) = A001653(n) = A000129(2n+1). - _Paul Barry_, Jan 22 2005
%C A079496 The lower principal and intermediate convergents to 2^(1/2), beginning with 1/1, 4/3, 7/5, 24/17, 41/29, form a strictly increasing sequence; essentially, numerators=A143608 and denominators=A079496. - _Clark Kimberling_, Aug 27 2008
%C A079496 From _Richard Choulet_, May 09 2010: (Start)
%C A079496 This sequence is a particular case of the following situation: a(0)=1, a(1)=a, a(2)=b with the recurrence relation a(n+3)=(a(n+2)*a(n+1)+q)/a(n) where q is given in Z to have Q=(a*b^2+q*b+a+q)/(a*b) itself in Z.
%C A079496 The g.f is f: f(z)=(1+a*z+(b-Q)*z^2+(a*b+q-a*Q)*z^3)/(1-Q*z^2+z^4); so we have the linear recurrence: a(n+4)=Q*a(n+2)-a(n).
%C A079496 The general form of a(n) is given by:
%C A079496 a(2*m)=sum((-1)^p*binomial(m-p,p)*Q^(m-2*p),p=0..floor(m/2))+(b-Q)*sum((-1)^p*binomial(m-1-p,p)*Q^(m-1-2*p),p=0..floor((m-1)/2)) and
%C A079496 a(2*m+1)=a*sum((-1)^p*binomial(m-p,p)*Q^(m-2*p),p=0..floor(m/2))+(a*b+q-a*Q)*sum((-1)^p*binomial(m-1-p,p)*Q^(m-1-2*p),p=0..floor((m-1)/2)). (End)
%C A079496 The integer square roots of floor(n^2/2 + 1) or (A007590 + 1). - _Richard R. Forberg_, Aug 01 2013
%D A079496 Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.
%H A079496 Indranil Ghosh, <a href="/A079496/b079496.txt">Table of n, a(n) for n = 0..2608</a>
%H A079496 Yurii S. Bystryk, Vitalii L. Denysenko, and Volodymyr I. Ostryk, <a href="http://dx.doi.org/10.13140/RG.2.2.16511.73129">Lune and Lens Sequences</a>, ResearchGate preprint, 2024. See pp. 47, 56.
%H A079496 John M. Campbell, <a href="http://arxiv.org/abs/1105.3399">An Integral Representation of Kekulé Numbers, and Double Integrals Related to Smarandache Sequences</a>, arXiv:1105.3399 [math.GM], 2011.
%H A079496 Clark Kimberling, <a href="http://dx.doi.org/10.1007/s000170050020">Best lower and upper approximates to irrational numbers</a>, Elemente der Mathematik, 52 (1997) 122-126.
%H A079496 Yujun Yang and Heping Zhang, <a href="http://dx.doi.org/10.1002/qua.21537">Kirchhoff Index of linear hexagonal chains</a>, Int. J. Quant. Chem. 108 (2008) 503-512, eq (3.3).
%H A079496 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,6,0,-1).
%F A079496 a(2n+1) - a(2n) = a(2n) - a(2n-1) = A001542(n).
%F A079496 a(2n+1) = ceiling((2+sqrt(2))/4*(3+2*sqrt(2))^n), a(2n) = ceiling(1/2*(3+2*sqrt(2))^n).
%F A079496 G.f.: (1 + x - 3*x^2 - x^3)/(1 - 6*x^2 + x^4).
%F A079496 a(n)*a(n+3) - a(n+1)*a(n+2) = 2. - _Paul D. Hanna_, Feb 22 2003
%F A079496 a(n) = 6*a(n-2) - a(n-4). - _R. J. Mathar_, Apr 04 2008
%F A079496 a(-n) = a(n) = A010914(n-3)*2^floor((4 - n)/2). - _Michael Somos_, Sep 03 2013
%F A079496 a(n) = (sqrt(2)*sqrt(2+(3-2*sqrt(2))^n+(3+2*sqrt(2))^n))/(2+sqrt(2)+(-1)^n*(-2+sqrt(2))). - _Gerry Martens_, Jun 06 2015
%F A079496 a(n) = 2^(n - 1)*H(n, n mod 2, 1/2) for n >= 3 where H(n, a, b) = hypergeom([a - n/2, b - n/2], [1 - n], -1). - _Peter Luschny_, Sep 03 2019
%F A079496 a(n) == Pell(n)^(-1) (mod Pell(n+1)) where Pell(n) = A000129(n), use the identity a(n)*Pell(n) - A084068(n-1)*Pell(n+1) = 1, taken modulo Pell(n+1). - _Gary W. Adamson_, Nov 21 2023
%F A079496 E.g.f.: cosh(x)*(cosh(sqrt(2)*x) + sinh(sqrt(2)*x)/sqrt(2)). - _Stefano Spezia_, Apr 21 2025
%e A079496 1 + x + 3*x^2 + 5*x^3 + 17*x^4 + 29*x^5 + 99*x^6 + 169*x^7 + 577*x^8 + ...
%p A079496 H := (n, a, b) -> hypergeom([a - n/2, b - n/2], [1 - n], -1):
%p A079496 a := n -> `if`(n < 3, [1, 1, 3][n+1], 2^(n - 1)*H(n, irem(n, 2), 1/2)):
%p A079496 seq(simplify(a(n)), n=0..26); # _Peter Luschny_, Sep 03 2019
%t A079496 a[1] = 1; a[2] = 3; a[3] = 5; a[n_] := a[n] = (a[n-1]*a[n-2] + 2) / a[n-3]; Table[a[n], {n, 1, 29}] (* _Jean-François Alcover_, Jul 17 2013, after _Paul D. Hanna_ *)
%o A079496 (PARI) {a(n) = n = abs(n); 2^((4-n)\2) * real( (10 + 7 * quadgen(8)) / 2 * (2 + quadgen(8))^(n-3) ) } /* _Michael Somos_, Sep 03 2013 */
%o A079496 (PARI) {a(n) = polcoeff( (1 + x - 3*x^2 - x^3) / (1 - 6*x^2 + x^4) + x * O(x^abs(n)), abs(n))} /* _Michael Somos_, Sep 03 2013 */
%Y A079496 Cf. A010914, A058580.
%Y A079496 Cf. A000129, A084068.
%K A079496 nonn,easy
%O A079496 0,3
%A A079496 _Benoit Cloitre_, Jan 20 2003
%E A079496 a(0)=1 added by _Michael Somos_, Sep 03 2013