A075848 -id:A075848 - cp's OEIS frontend

A156035 Decimal expansion of 3 + 2*sqrt(2).

5, 8, 2, 8, 4, 2, 7, 1, 2, 4, 7, 4, 6, 1, 9, 0, 0, 9, 7, 6, 0, 3, 3, 7, 7, 4, 4, 8, 4, 1, 9, 3, 9, 6, 1, 5, 7, 1, 3, 9, 3, 4, 3, 7, 5, 0, 7, 5, 3, 8, 9, 6, 1, 4, 6, 3, 5, 3, 3, 5, 9, 4, 7, 5, 9, 8, 1, 4, 6, 4, 9, 5, 6, 9, 2, 4, 2, 1, 4, 0, 7, 7, 7, 0, 0, 7, 7, 5, 0, 6, 8, 6, 5, 5, 2, 8, 3, 1, 4, 5, 4, 7, 0, 0, 2

Offset: 1

Klaus Brockhaus, Feb 02 2009

Limit_{n -> oo} b(n+1)/b(n) = 3+2*sqrt(2) for b = A155464, A155465, A155466.
Limit_{n -> oo} b(n)/b(n-1) = 3+2*sqrt(2) for b = A001652, A001653, A002315, A156156, A156157, A156158. - Klaus Brockhaus, Sep 23 2009
From Richard R. Forberg, Aug 14 2013: (Start)
Ratios b(n+1)/b(n) for all sequences of the form b(n) = 6*b(n-1) - b(n-2), for any initial values of b(0) and b(1), converge to this ratio.
Ratios b(n+1)/b(n) for all sequences of the form b(n) = 5*b(n-1) + 5*b(n-2) + b(n-3), for all b(0), b(1) and b(2) also converge to 3 + 2*sqrt(2). For example see A084158 (Pell Triangles).
Ratios of alternating values, b(n+2)/b(n), for all sequences of the form b(n) = 2*b(n-1) + b(n-2), also converge to 3 + 2*sqrt(2). These include A000129 (Pell Numbers). Also see A014176. (End)
Let ABCD be a square inscribed in a circle. When P is the midpoint of the arc AB, then the ratio (PC*PD)/(PA*PB) is equal to 3+2*sqrt(2). See the Mathematical Reflections link. - Michel Marcus, Jan 10 2017
Limit of ratios of successive terms of A001652 when n-> infinity. - Harvey P. Dale, Jun 16 2017; improved by Bernard Schott, Feb 28 2022
A quadratic integer with minimal polynomial x^2 - 6x + 1. - Charles R Greathouse IV, Jul 11 2020
Ratio between radii of the large circumscribed circle R and the small internal circle r drawn on the Sangaku tablet at Isaniwa Jinjya shrine in Ehime Prefecture (pictures in links). - Bernard Schott, Feb 25 2022

			3 + 2*sqrt(2) = 5.828427124746190097603377448...

Diogo Queiros-Condé and Michel Feidt, Fractal and Trans-scale Nature of Entropy, Iste Press and Elsevier, 2018, page 45.

Ivan Panchenko, Table of n, a(n) for n = 1..1000
Mathematical Reflections, Solution to Problem J286, Issue 1, 2014, p. 5.
Bernard Schott, Sangaku at Isaniwa Jinya, The six circles.
Terakoya Suzu, Sangaku (mathematics tablet) II, Sangaku at Isaniwa Jinya shrine.
Wikipedia, Sangaku.
Bernard Ycart, Les Sangakus, Sangaku du Temple Isaniwa Jinya (in French).
Index entries for algebraic numbers, degree

Cf. A002193 (sqrt(2)), A090488, A010466, A014176.
Cf. A155464, A155465, A155466.
Cf. A104178 (decimal expansion of log_10(3+2*sqrt(2))).
Cf. A000129, A001109, A001541, A001542, A001652, A001653, A002315, A005319, A075870, A038723, A038725, A038761, A054488, A054489, A075848, A077413, A084158, A106328, A156156, A156157, A156158.
Cf. A242412 (sangaku).

SetDefaultRealField(RealField(100));  3 + 2*Sqrt(2); // G. C. Greubel, Aug 21 2018

RealDigits[N[3+2*Sqrt[2],200]][[1]] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2011 *)

3+sqrt(8) \\ Charles R Greathouse IV, Jun 10 2011

Equals 1 + A090488 = 3 + A010466. - R. J. Mathar, Feb 19 2009
Equals exp(arccosh(3)), since arccosh(x) = log(x+sqrt(x^2-1)). - Stanislav Sykora, Nov 01 2013
Equals (1+sqrt(2))^2, that is, A014176^2. - Michel Marcus, May 08 2016
The periodic continued fraction is [5; [1, 4]]. - Stefano Spezia, Mar 17 2024

A072221 a(n) = 6*a(n-1) - a(n-2) + 2, with a(0)=1, a(1)=4.

Original entry on oeis.org

1, 4, 25, 148, 865, 5044, 29401, 171364, 998785, 5821348, 33929305, 197754484, 1152597601, 6717831124, 39154389145, 228208503748, 1330096633345, 7752371296324, 45184131144601, 263352415571284, 1534930362283105, 8946229758127348, 52142448186480985

Offset: 0

Lekraj Beedassy, Jul 04 2002

The product of three consecutive triangular numbers with middle term A000217(m) where m is in this sequence is a square.
k is in this sequence iff the triangle with sides 3,k,k+1 has integer area. Equivalently, numbers k such that 2*(k+2)*(k-1) is a square. - James R. Buddenhagen, Oct 19 2008
Triangular numbers that are equal to a square plus one have this sequence as indices. For example, the 25th triangular number is 25*26/2 = 325 = 18^2 + 1. - Tanya Khovanova and Alexey Radul, Aug 08 2009
The triangle with sides 3, a(n), a(n)+1 has area A075848(n) if n>=0. - Michael Somos, Dec 25 2018
Compare with A016064 for integers m with triangles with sides 4, m, m+2 and integer area. - Michael Somos, May 11 2019

			From _Michael Somos_, Dec 25 2018: (Start)
For n=1, the triangle (3, 4, 5) has area 6 = A075848(1).
For n=2, the triangle (3, 25, 26) has area 36 = A075848(2). (End)

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
Sylvester Robins, Certain Series of Integral, Rational, Scalene Triangles, The American Mathematical Monthly, Vol. 1, No. 1 (Jan., 1894), pp. 13-14. See Example I.
Index entries for linear recurrences with constant coefficients, signature (7,-7,1).

Cf. A000217, A001108, A001541, A016064, A075848.

a072221 n = a072221_list !! n
a072221_list = 1 : 4 : (map (+ 2) $
   zipWith (-) (map (* 6) $ tail a072221_list) a072221_list)
-- Reinhard Zumkeller, Apr 27 2012

a[n_] := a[n] = 6a[n - 1] - a[n - 2] + 2; a[0] = 1; a[1] = 4; Table[ a[n], {n, 0, 20}]
LinearRecurrence[{7, -7, 1}, {1, 4, 25}, 25] (* T. D. Noe, Dec 09 2013 *)
a[ n_] := (3 ChebyshevT[ n, 3] - 1) / 2; (* Michael Somos, Dec 25 2018 *)

{a(n) = (3 * polchebyshev( n, 1, 3) - 1) / 2}; /* Michael Somos, Dec 25 2018 */

a(n) = (3*A001541(n) - 1)/2.
a(n) = 3*A001108(n) + 1. - David Scheers, Dec 25 2006
From Franz Vrabec, Aug 21 2006: (Start)
a(n) = -1/2 + (3/4)*((3+sqrt(8))^n + (3-sqrt(8))^n) for n >= 0.
a(n) = floor((3/4)*(3+sqrt(8))^n) for n > 0. (End)
G.f.: (1-3x+4x^2)/((1-x)(1-6x+x^2)). - R. J. Mathar, Sep 09 2008
a(n) = a(-n) for all n in Z. - Michael Somos, Dec 25 2018

Edited by Robert G. Wilson v, Jul 08 2002

A164055 Triangular numbers that are one plus a perfect square.

Original entry on oeis.org

1, 10, 325, 11026, 374545, 12723490, 432224101, 14682895930, 498786237505, 16944049179226, 575598885856165, 19553418069930370, 664240615491776401, 22564627508650467250, 766533094678624110085, 26039560591564569275626

Offset: 1

Tanya Khovanova & Alexey Radul, Aug 08 2009

a(n+1) is the second element of the n-th set of three consecutive triangular numbers whose product is a perfect square. - Arkadiusz Wesolowski, Apr 27 2012

The triangular numbers of this sequence satisfy the Diophantine equation T(k) = k*(k+1)/2 = m^2 + 1, which is equivalent to (2k+1)^2 - 2*(2m)^2 = 9. Now, with x=2k+1 and y=2m, the Pell-Fermat equation x^2 - 2*y^2 = 9 appears. The solutions x and y of this equation are respectively in A106329 and A075848. The indices k=(x-1)/2 of the triangular numbers of this sequence are in A072221, while the indices m=y/2 of the corresponding square numbers are in A106328. - Bernard Schott, Mar 09 2019

			10 is in this sequence because it is a triangular number A000217(4) and is equal to a square plus 1: 10 = 3^2 + 1.

Reinhard Zumkeller, Table of n, a(n) for n = 1..500
K. B. Subramaniam, Almost Square Triangular Numbers, The Fibonacci Quarterly, Vol. 37, No. 3 (1999), pp. 194-197.
Index entries for linear recurrences with constant coefficients, signature (35,-35,1).

Cf. A001110, A106329, A075848 (solutions of x^2 - 2 * y^2 = 9).

Cf. A072221 (indices of the triangular terms of this sequence), A106328 (indices of the corresponding square numbers).

a164055 n = a164055_list !! (n-1)
a164055_list = 1 : 10 : 325 : zipWith (+) a164055_list
   (map (* 35) $ tail $ zipWith (-) (tail a164055_list) a164055_list)
-- Reinhard Zumkeller, Apr 29 2012

LinearRecurrence[{35,-35,1}, {1,10,325}, 50] (* G. C. Greubel, Sep 09 2017 *)

my(x='x+O('x^50)); Vec(x*(1-25*x+10*x^2)/((1-x)*(x^2-34*x+1))) \\ G. C. Greubel, Sep 09 2017

A000217 INTERSECT A002522.
a(n) = A000217(A072221(n-1)).
From R. J. Mathar, Sep 22 2009: (Start)
a(n) = 35*a(n-1) - 35*a(n-2) + a(n-3).
G.f.: x*(1-25*x+10*x^2)/((1-x)*(x^2-34*x+1)). (End)
A010054(a(n)) * A010052(a(n) - 1) = 1. - Reinhard Zumkeller, Apr 29 2012
a(n) = (A106329(n) - 1)*(A106329(n) + 1)/8 = (A106328(n))^2 + 1. - Bernard Schott, Mar 10 2019
a(n) = (14 + 9*(17+12*sqrt(2))^(1-n) - 9*(-17+12*sqrt(2))*(17+12*sqrt(2))^n) / 32. - Colin Barker, Mar 23 2019
a(n) = 9 * A001110(n) + 1 (Subramaniam, 1999). - Amiram Eldar, Jan 13 2022

Comment molded into formula by R. J. Mathar, Sep 22 2009

A114689 Expansion of (1 +4x -x^2)/((1-x^2)(1-2*x-x^2)); a Pellian-related sequence.

Original entry on oeis.org

1, 6, 13, 36, 85, 210, 505, 1224, 2953, 7134, 17221, 41580, 100381, 242346, 585073, 1412496, 3410065, 8232630, 19875325, 47983284, 115841893, 279667074, 675176041, 1630019160, 3935214361, 9500447886, 22936110133, 55372668156, 133681446445, 322735561050

Offset: 0

Creighton Dement, Feb 18 2006

Elements of odd index give match to A075848: 2*n^2 + 9 is a square. Generating floretion: - 1.5'i + 'j + 'k - .5i' + j' + k' + .5'ii' - .5'jj' - .5'kk' - 'ij' + 'ik' - 'ji' + .5'jk' + 2'ki' - .5'kj' + .5e

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2,2,-2,-1).

Cf. A000129, A005409, A100828, A111954, A113224.

Cf. A114647, A114688, A114695, A114696, A114697.

I:=[1,6,13,36]; [n le 4 select I[n] else 2*Self(n-1) +2*Self(n-2) -2*Self(n-3) -Self(n-4): n in [1..31]]; // G. C. Greubel, May 24 2021

Table[3*Fibonacci[n+1, 2] -1-(-1)^n, {n, 0, 30}] (* G. C. Greubel, May 24 2021 *)

Vec((-1-4*x+x^2)/((1-x)*(x+1)*(x^2+2*x-1)) + O(x^30)) \\ Colin Barker, May 26 2016

[3*lucas_number1(n+1,2,-1) -(1+(-1)^n) for n in (0..30)] # G. C. Greubel, May 24 2021

G.f.: (1 +4*x -x^2)/((1-x)*(1+x)*(1-2*x-x^2)).
From Colin Barker, May 26 2016: (Start)
a(n) = (-1 - (-1)^n) + 3*((1+sqrt(2))^(1+n) - (1-sqrt(2))^(1+n))/(2*sqrt(2)).
a(n) = 2*a(n-1) +2*a(n-2) -2*a(n-3) -a(n-4) for n>3.
(End)
a(n) = 3*A000129(n+1) - (1 + (-1)^n). - G. C. Greubel, May 24 2021

A175497 Numbers k with the property that k^2 is a product of two distinct triangular numbers.

Original entry on oeis.org

0, 6, 30, 35, 84, 180, 204, 210, 297, 330, 546, 840, 1170, 1189, 1224, 1710, 2310, 2940, 2970, 3036, 3230, 3900, 4914, 6090, 6930, 7134, 7140, 7245, 7440, 8976, 10710, 12654, 14175, 14820, 16296, 16380, 17220, 19866, 22770, 25172, 25944, 29103

Offset: 1

Zak Seidov, May 30 2010

nonn

From Robert G. Wilson v, Jul 24 2010: (Start)
Terms in the i-th row are products contributed with a factor A000217(i):
(1) 0, 6, 35, 204, 1189, 6930, 40391, 235416, 1372105, 7997214, 46611179, ...
(2) 30, 297, 2940, 29103, 288090, 2851797, 28229880, ...
(3) 84, 1170, 16296, 226974, 3161340, ...
(4) 180, 3230, 57960, 1040050, 18662940, ...
(5) 330, 7245, 159060, 3492075, 76666590, ...
(6) 546, 14175, 368004, 9553929, ...
(7) 840, 25172, 754320, 22604428, ...
(8) 210, 1224, 7134, 41580, 242346, 1412496, 8232630, 47983284, ...
(9) 1710, 64935, 2465820, 93636225, ...
(10) 2310, 96965, 4070220, ...
(11) 3036, 139590, 6418104, ...
(12) 3900, 194922, 9742200, ...
(13) 4914, 265265, 14319396, ...
(14) 6090, 353115, 20474580, ...
(15) 7440, 461160, 28584480, ...
(End)
Numbers m with property that m^2 is a product of two distinct triangular numbers T(i) and T(j) such that i and j are in the same row of the square array A(n, k) defined in A322699. - Onur Ozkan, Mar 17 2023

R. J. Mathar, Table of n, a(n) for n = 1..1000 replacing a b-file of _Robert G. Wilson v_ of 2010.
R. J. Mathar, OEIS A175497, Mar 16 2023
Project Euler, Problem 833. Square Triangle Products.
M. Ulas, On certain diophantine equations related to triangular and tetrahedral numbers, arXiv:0811.2477 [math.NT], 2008. Theorem 5.6.

From Robert G. Wilson v, Jul 24 2010: (Start)
A001109 (with the exception of 1), A011945, A075848 and A055112 are all proper subsets.
Many terms are in common with A147779.
Cf. A001108, A132596, A007654, A001108, A132593. (End)
Cf. A152005 (two distinct tetrahedral numbers).

isA175497 := proc(n)
    local i,Ti,Tj;
    if n = 0 then
        return true;
    end if;
    for i from 1 do
        Ti := i*(i+1)/2 ;
        if Ti > n^2 then
            return false;
        else
            Tj := n^2/Ti ;
            if Tj <> Ti and type(Tj,'integer') then
                if isA000217(Tj) then  # code in A000217
                    return true;
                end if;
            end if;
        end if;
    end do:
end proc:
for n from 0 do
    if isA175497(n) then
        printf("%d,\n",n);
    end if;
end do: # R. J. Mathar, May 26 2016

triangularQ[n_] := IntegerQ[Sqrt[8n + 1]];
okQ[n_] := Module[{i, Ti, Tj}, If[n == 0, Return[True]]; For[i = 1, True, i++, Ti = i(i+1)/2; If[Ti > n^2, Return[False], Tj = n^2/Ti; If[Tj != Ti && IntegerQ[Tj], If[ triangularQ[Tj], Return[True]]]]]];
Reap[For[k = 0, k < 30000, k++, If[okQ[k], Print[k]; Sow[k]]]][[2, 1]] (* Jean-François Alcover, Jun 13 2023, after R. J. Mathar *)

from itertools import count, islice, takewhile
from sympy import divisors
from sympy.ntheory.primetest import is_square
def A175497_gen(startvalue=0): # generator of terms >= startvalue
    return filter(lambda k:not k or any(map(lambda d: is_square((d<<3)+1) and is_square((k**2//d<<3)+1), takewhile(lambda d:d**2A175497_list = list(islice(A175497_gen(),20)) # Chai Wah Wu, Mar 13 2023

def A175497_list(n):
    def A322699_A(k, n):
        p, q, r, m = 0, k, 4*k*(k+1), 0
        while m < n:
            p, q, r = q, r, (4*k+3)*(r-q) + p
            m += 1
        return p
    def a(k, n, j):
        if n == 0: return 0
        p = A322699_A(k, n)*(A322699_A(k, n)+1)*(2*k+1) - a(k, n-1, 1)
        q = (4*k+2)*p - A322699_A(k, n)*(A322699_A(k, n)+1)//2
        m = 1
        while m < j: p, q = q, (4*k+2)*q - p; m += 1
        return p
    A = set([a(k, 1, 1) for k in range(n+1)])
    k, l, m = 1, 1, 2
    while True:
        x = a(k, l, m)
        if x < max(A):
            A |= {x}
            A  = set(sorted(A)[:n+1])
            m += 1
        else:
            if m == 1 and l == 1:
                if k > n:
                    return sorted(A)
                k += 1
            elif m > 1:
                l += 1; m = 1
            elif l > 1:
                k += 1; l, m = 1, 1
# Onur Ozkan, Mar 15 2023

a(n)^2 = A169836(n). - R. J. Mathar, Mar 12 2023

A098212 Expansion of (5-x^2)/((1+x)(1-6x+x^2)).

Original entry on oeis.org

5, 25, 149, 865, 5045, 29401, 171365, 998785, 5821349, 33929305, 197754485, 1152597601, 6717831125, 39154389145, 228208503749, 1330096633345, 7752371296325, 45184131144601, 263352415571285, 1534930362283105, 8946229758127349, 52142448186480985

Offset: 0

Creighton Dement, Oct 25 2004

Old name was: Relates the squares of Pell numbers with the squares of the numerators of continued fraction convergents to sqrt(2).

Floretion Algebra Multiplication Program, FAMP Code: 1vesseq[(j' + k' + 'ii')*('j + 'k + 'ii')] - Creighton Dement, Aug 16 2005

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,5,-1).

Cf. A000129, A001333, A001541, A079291, A075848, A090390.

I:=[5,25,149]; [n le 3 select I[n] else 5*Self(n-1)+5*Self(n-2)-Self(n-3): n in [1..40]]; // Vincenzo Librandi, Jul 26 2015

a[0]= 5; a[1]= 25; a[2]= 149; a[n_]:= a[n]= 5 a[n-1] + 5 a[n-2] - a[n-3]; Table[ a[n], {n,0,40}] (* Robert G. Wilson v, Nov 05 2004 *)
CoefficientList[Series[(5-x^2)/((1+x)(1-6x+x^2)),{x,0,40}],x] (* or *) LinearRecurrence[{5,5,-1},{5,25,149},40] (* Harvey P. Dale, Jun 09 2011 *)

Vec((5-x^2)/((1+x)*(1-6*x+x^2))+O(x^99)) \\ Charles R Greathouse IV, Sep 27 2012

def Pell(n): return lucas_number1(n,2,-1)
[4*Pell(n+1)^2 +(Pell(n+1) +Pell(n))^2  for n in (0..40)] # G. C. Greubel, Aug 20 2022

G.f.: (5-x^2)/((1+x)*(1-6*x+x^2)).
a(n) = 4*A079291(n+1) + A090390(n+1) = 4(A000129(n+1))^2 + (A001333(n+1))^2.
a(n) + a(n+1) = A075848(n+2) - A075848(n+1).
a(n) = A001541(n+1) + 2*A079291(n+1). - Creighton Dement, Oct 26 2004
a(n) = 5*a(n-1) + 5*a(n-2) - a(n-3), a(0) = 5, a(1) = 25, a(2) = 149. - Robert G. Wilson v, Nov 05 2004
2*a(n) = (-1)^n + 3*A001541(n+1). - R. J. Mathar, Sep 11 2019

cp's OEIS Frontend

A156035 Decimal expansion of 3 + 2*sqrt(2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A072221 a(n) = 6*a(n-1) - a(n-2) + 2, with a(0)=1, a(1)=4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

Extensions

A164055 Triangular numbers that are one plus a perfect square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

Extensions

A114689 Expansion of (1 +4*x -x^2)/((1-x^2)*(1-2*x-x^2)); a Pellian-related sequence.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A175497 Numbers k with the property that k^2 is a product of two distinct triangular numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Python

Python

Formula

A098212 Expansion of (5-x^2)/((1+x)*(1-6*x+x^2)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

A114689 Expansion of (1 +4x -x^2)/((1-x^2)(1-2*x-x^2)); a Pellian-related sequence.

A098212 Expansion of (5-x^2)/((1+x)(1-6x+x^2)).