A076140 -id:A076140 - cp's OEIS frontend

A341895 Indices of triangular numbers that are ten times other triangular numbers.

0, 4, 20, 39, 175, 779, 1500, 6664, 29600, 56979, 253075, 1124039, 2163720, 9610204, 42683900, 82164399, 364934695, 1620864179, 3120083460, 13857908224, 61550154920, 118481007099, 526235577835, 2337285022799, 4499158186320, 19983094049524, 88755280711460, 170849530073079, 758831338304095, 3370363382012699

Offset: 1

Vladimir Pletser, Feb 23 2021

Second member of the Diophantine pair (b(n), a(n)) that satisfies a(n)^2 + a(n) = 10*(b(n)^2 + b(n)) or T(a(n)) = 10*T(b(n)) where T(x) is the triangular number of x. The T(b)'s are in A068085 and the b's are in A341893.

Can be defined for negative n by setting a(-n) = -a(n+1) - 1 for all n in Z.

			a(2) = 4 is a term because its triangular number, T(a(2)) = 4*5 / 2 = 10 is ten times a triangular number.
a(4) = 38*a(1) - a(-2) + 18 = 38*0 - (-21) + 18 = 39, etc.

Vladimir Pletser, Table of n, a(n) for n = 1..1000
Vladimir Pletser, Using Pell equation solutions to find all triangular numbers multiple of other triangular numbers, 2022.
Index entries for linear recurrences with constant coefficients, signature (1,38,-38,-1,1).

Cf. A341893, A068085, A166477 (n=10).

Cf. A336623, A336624, A336626, A336625, A053141, A001652, A075528, A029549, A061278, A001571, A076139, A076140, A077259, A077262, A077260, A077261, A077288, A077291, A077289, A077290, A077398, A077401, A077399, A077400, A000217.

f := gfun:-rectoproc({a(-2) = -21, a(-1) = -5, a(0) = -1, a(1) = 0, a(2) = 4, a(3) = 20, a(n) = 38*a(n-3)-a(n-6)+18}, a(n), remember); map(f, [`$`(0 .. 1000)]) ; #

Rest@ CoefficientList[Series[x^2*(4 + 16*x + 19*x^2 - 16*x^3 - 4*x^4 - x^5)/(1 - x - 38*x^3 + 38*x^4 + x^6 - x^7), {x, 0, 30}], x] (* Michael De Vlieger, May 19 2022 *)

a(n) = 38*a(n-3) - a(n-6) + 18 for n > 3, with a(-2) = -21, a(-1) = -5, a(0) = -1, a(1) = 0, a(2) = 4, a(3) = 20.
a(n) = a(n-1) + 38*(a(n-3) - a(n-4)) - (a(n-6) - a(n-7)) for n >= 4 with a(-2) = -21, a(-1) = -5, a(0) = -1, a(1) = 0, a(2) = 4, a(3) = 20.
G.f.: x^2*(4 + 16*x + 19*x^2 - 16*x^3 - 4*x^4 - x^5)/(1 - x - 38*x^3 + 38*x^4 + x^6 - x^7). - Stefano Spezia, Feb 24 2021
a(n) = (A198943(n) + 1)/2 - 1. - Hugo Pfoertner, Feb 26 2021

A253651 Triangular numbers that are the product of a triangular number and a prime number.

Original entry on oeis.org

0, 3, 6, 15, 21, 45, 66, 78, 105, 190, 210, 231, 435, 465, 630, 861, 903, 1035, 1326, 2415, 2556, 2628, 3003, 3570, 4005, 4950, 5460, 5565, 5995, 7140, 8646, 8778, 9870, 12246, 16471, 16836, 17205, 17391, 17766, 20100, 22155, 26565, 26796, 28680, 28920, 30381, 32131, 33411, 33930, 36856

Offset: 1

Antonio Roldán, Jan 07 2015

nonn

			190 is in the sequence because it is triangular (190=19*20/2) and 190=10*19, with 10 triangular number and 19 prime number.

Harvey P. Dale, Table of n, a(n) for n = 1..259 (all terms up to and including the 10000th triangular number)

Cf. A029549 (T is 2*t), A076140 (T is 3*t), A225503 (first T to be prime(n)*t).

Cf. A188630, A253650, A253652, A253653.

N:= 10^5: # to get all terms <= N
Primes:= select(isprime, [2,seq(2*k+1,k=1..N/3)]):
select(t -> issqr(1+8*t), {seq(seq(a*(a+1)/2*p, a = 2 .. floor(sqrt(2*N/p))), p = Primes)});
# if using Maple 11 or earlier, uncomment the next line
# sort(convert(%,list)); # Robert Israel, Jan 07 2015

Join[{0},Module[{nn=300,trs},trs=Accumulate[Range[nn]];Select[ trs,AnyTrue[ #/trs,PrimeQ]&]]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Oct 16 2018 *)

{i=1; j=2;print1(0,", "); while(i<=10^5, k=1; p=2; c=0; while(k1, c=k); if(c>0, print1(i, ", ")); k+=p; p+=1); i+=j; j+=1)}

A341893 Indices of triangular numbers that are one-tenth of other triangular numbers.

Original entry on oeis.org

0, 1, 6, 12, 55, 246, 474, 2107, 9360, 18018, 80029, 355452, 684228, 3039013, 13497834, 25982664, 115402483, 512562258, 986657022, 4382255359, 19463867988, 37466984190, 166410301177, 739114421304, 1422758742216, 6319209189385, 28066884141582, 54027365220036, 239963538895471, 1065802482958830, 2051617119619170

Offset: 1

Vladimir Pletser, Feb 23 2021

The indices of triangular numbers that are one-tenth of other triangular numbers [t of T(t) such that T(t)=T(u)/10].
First member of the Diophantine pair (t, u) that satisfies 10*(t^2 + t) = u^2 + u; a(n) = t.
The T(t)'s are in A068085 and the u's are in A341895.
Also, nonnegative t such that 40*t^2 + 40*t + 1 is a square.
Can be defined for negative n by setting a(n) = a(-1-n) for all n in Z.

			a(4) = 12 is a term because its triangular number, (12*13) / 2 = 78 is one-tenth of 780, the triangular number of 39.
a(4) = 38 a(1) - a(-2) +18 = 0 - 6 +18 = 12 ;
a(5) = 38 a(2) - a(-1) + 18 = 38*1 - 1 +18 = 55.

Vladimir Pletser, Table of n, a(n) for n = 1..1000
Vladimir Pletser, Using Pell equation solutions to find all triangular numbers multiple of other triangular numbers, 2022.
V. Pletser, Recurrent relations for triangular multiples of other triangular numbers, Indian J. Pure Appl. Math. 53 (2022) 782-791
Index entries for linear recurrences with constant coefficients, signature (1,38,-38,-1,1).

Cf. A068085, A341895.
Cf. A336623, A336624, A336626, A336625, A053141, A001652, A075528, A029549, A061278, A001571, A076139, A076140, A077259, A077262, A077260, A077261, A077288, A077291, A077289, A077290, A077398, A077401, A077399, A077400, A000217.
Cf. A180003.

f := gfun:-rectoproc({a(-3) = 6, a(-2) = 1, a(-1) = 0, a(0) = 0, a(1) = 1, a(2) = 6, a(n) = 38*a(n-3)-a(n-6)+18}, a(n), remember); map(f, [`$`(0 .. 1000)])[] ;

Rest@ CoefficientList[Series[(x^2*(1 + 5*x + 6*x^2 + 5*x^3 + x^4))/(1 - x - 38*x^3 + 38*x^4 + x^6 - x^7), {x, 0, 31}], x] (* Michael De Vlieger, May 19 2022 *)

a(n) = (-1 + sqrt(8*b(n) + 1))/2 where b(n) = A068085(n).
a(n) = 38 a(n-3) - a(n-6) + 18 for n > 3, with a(-2) = 6, a(-1) = 1, a(0) = 0, a(1) = 0, a(2) = 1, a(3) = 6.
a(n) = a(n-1) + 38*(a(n-3) - a(n-4)) - (a(n-6) - a(n-7)) for n >= 4 with a(-2) = 6, a(-1) = 1, a(0) = 0, a(1) = 0, a(2) = 1, a(3) = 6.
G.f.: x^2*(1 + 4*x+x^2)*(1+x+x^2)/ ((1-x)*(1-38*x^3+x^6)). - Stefano Spezia, Feb 24 2021
a(n) = A180003(n) - 1. - Hugo Pfoertner, Feb 28 2021

A112355 Triangular numbers that are the sum of three positive triangular numbers.

Original entry on oeis.org

3, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105, 120, 136, 153, 171, 190, 210, 231, 253, 276, 300, 325, 351, 378, 406, 435, 465, 496, 528, 561, 595, 630, 666, 703, 741, 780, 820, 861, 903, 946, 990, 1035, 1081, 1128, 1176, 1225, 1275, 1326

Offset: 1

Rick L. Shepherd, Sep 06 2005

nonn

A112353 is a subsequence: it requires the three positive triangular numbers to be distinct. The positive terms of A076140 are a subsequence.

			21 is a term because 21 = 3 + 3 + 15 and these four numbers are positive triangular numbers (A000217(6) = A000217(2) + A000217(2) + A000217(5)). {Also 21 = 1 + 10 + 10 = A000217(1) + A000217(4) + A000217(4).}.

Cf. A000217 (triangular numbers), A089982 (triangular numbers that are the sum of two positive triangular numbers), A112353, A076140 (the three triangular numbers summed are identical).

A341894 For square n > 0, a(n) = 0; for nonsquare n > 0, a(n) is the rank r such that t(r) + t(r-1) = u(r) - u(r-1) - 1, where u(r) and t(r) are indices of some triangular numbers in the Diophantine relation T(u(r)) = n*T(t(r)).

Original entry on oeis.org

0, 1, 1, 0, 2, 2, 2, 2, 0, 3, 2, 2, 4, 2, 2, 0, 2, 2, 3, 2, 4, 4, 2, 2, 0, 3, 2, 4, 4, 2, 4, 2, 2, 2, 2, 0, 2, 2, 2, 4, 4, 2, 4, 2, 4, 6, 2, 2, 0, 3, 3, 4, 4, 2, 4, 2, 4, 4, 2, 2, 8, 2, 2, 0, 2, 4, 4, 2, 4, 4, 4, 2, 6, 2, 2, 6, 4, 4, 2, 2, 0, 3, 2, 2, 8, 4, 2, 4, 4, 2, 6, 4, 4, 4, 2, 4, 4, 2, 2, 0, 2, 2, 4, 2, 4, 8, 2, 2, 8, 2

Offset: 1

Vladimir Pletser, Mar 06 2021

nonn

Let t(i) and u(j) be the indices of triangular numbers that satisfy the Diophantine relation T(u(j)) = n*T(t(i)) for some integers i and j. The number of solutions (t(i), u(j)) of T(u(j)) = n*T(t(i)) is 0 or 1 for square n, and an infinity for nonsquare n.
For square n, a(n) is arbitrarily set to 0.
For nonsquare n, a(n) is the index r in the sequence of t(i) and u(j) such that t(r) + t(r-1) = u(r) - u(r-1) - 1.
Alternatively, for nonsquare n, a(n) is the index r such that the ratio t(i)/t(i-r) is decreasing monotonically without jumps for increasing values of i.
Alternatively, for n > 4, a(n) is the index r such that the ratio t(r)/t(r-1) varies between (s+1)/(s-1) and (s+2)/s, with s = [sqrt(n)], where [x] = floor(x).
Alternatively, for nonsquare n, a(n) is the number of fundamental solutions (X_f, Y_f) of the generalized Pell equation X^2 - n*Y^2 = 1 - n providing odd solutions, i.e., with X_f odd and Y_f odd (or Y_f even if y_f is odd, where y_f is the fundamental solution of the associated simple Pell equation x^2 - n*y^2 = 1).

			The following table gives the first values of nonsquare n and a(n) and the sequences yielding the values of t, u, T(t) and T(u) such that T(u) = n*T(t).
n       2       3       5       6       7       8      10
a(n)    1       1       2       2       2       2       3
t    A053141 A061278 A077259 A077288 A077398 A336623  A341893*
u    A001652 A001571 A077262 A077291 A077401 A336625* A341895*
T(t) A075528 A076139 A077260 A077289 A077399 A336624  A068085*
T(u) A029549 A076140 A077261 A077290 A077400 A336626*   -
With a(n) = r, the definition t(r) + t(r-1) = u(r) - u(r-1) - 1 yields:
- For n = 2, a(n) = 1: A053141(1) + A053141(0) = A001652(1) - A001652(0) - 1, i.e., 2 + 0 = 3 + 0 - 1 = 2.
- For n = 5, a(n) = 2: A077259(2) + A077259(1) = A077262(2) - A077262(1) - 1, i.e., 6 + 2 = 14 - 5 - 1 = 8.
- For n = 10, a(n) = 3: A341893(3+1*) + A341893(2+1*) = A341895(3+1*) - A341895(2+1*) - 1, i.e., 12 + 6 = 39 - 20 - 1 = 18.
Note that for those sequences marked with an *, the first term 0 appears for n = 1, contrary to all the other sequences, where the first term 0 appears for n = 0; the numbering must therefore be adapted and 1 must be added to compensate for this shift in indices.
The monotonic decrease of t(i)/t(i-r) can be seen also as:
- For n = 2, a(n) = 1: for 1 <= i <= 6, A053141(i)/A053141(i-1) decreases monotonically from 7 to 5.829.
- For n = 5, a(n) = 2: for 3 <= i <= 8, A077259(i)/A077259(i-2) decreases monotonically from 22 to 17.948, while A077259(i)/A077259(i-1) takes values alternatively varying between 3 and 2.618 and between 7.333 and 6.855.
- For n = 10, a(n) = 3: for 4 <= i <= 10, A341893(i)/A341893(i-3) decreases monotonically from 55 to 38, while A077259(i) / A077259(i-1) takes values alternatively varying between 6 and 4.44 and between 2 and 1.925.
For n > 4, the relation (s+1)/(s-1) <=  t(r)/t(r-1) <= (s+2)/s, with s = [sqrt(n)], yields:
- For n = 5, a(n) = 2: A077259(2)/A077259(1) = 6/2 = 3, and s = [sqrt(5)] = 2, (s+1)/(s-1) = 3 and (s+2)/s = 2.
- For n = 10, a(n) = 3: A077259(3+1*)/A077259(2+1*) = 12/6 = 2, and s = [sqrt(10)] = 3, (s+1)/(s-1) = 2 and (s+2)/s = 5/3 = 1.667.
Finally, the number of fundamental solutions of the generalized Pell equation is as follows.
- For n = 2, X^2 - 2*Y^2 = -1 has a single fundamental solution, (X_f, Y_f) = (1, 1), and the rank a(n) is 1.
- For n = 5, X^2 - 5*Y^2 = -4 has two fundamental solutions, (X_f, Y_f) = (1, 1) and (-1, 1), and the rank a(n) is 2.
- For n = 10, X^2 - 10*Y^2 = -9 has three fundamental solutions, (X_f, Y_f) = (1, 1), (-1, 1), and (9, 3), and the rank a(n) is 3.

J. S. Chahal and H. D'Souza, "Some remarks on triangular numbers", in A.D. Pollington and W. Mean, eds., Number Theory with an Emphasis on the Markov Spectrum, Lecture Notes in Pure Math, Dekker, New York, 1993, 61-67.

Vladimir Pletser, Table of n, a(n) for n = 1..256
T. Breiteig, Quotients of triangular numbers, The Mathematical Gazette, 99, 2015, 243-255.
Keith Matthews, The Diophantine Equation x^2 - Dy^2 = N, D > 0, in integers, Expositiones Mathematicae, 18, 2000, 323-331.
Keith Matthews, Quadratic Diophantine equations BCMATH programs, 2020.
Vladimir Pletser, Searching for Multiple of Triangular Numbers being Triangular Numbers, ResearchGate, DOI: 10.13140/RG.2.2.35428.91527, 2021.
Vladimir Pletser, Triangular Numbers Multiple of Triangular Numbers and Solutions of Pell Equations, arXiv: 2102.13494 [math.NT], 2021.
Vladimir Pletser, Recurrent Relations for Multiple of Triangular Numbers being Triangular Numbers, arXiv: 2101.00998 [math.NT], 2021.

Cf. A068085, A053141, A061278, A077259, A077288, A077398, A336623, A341893, A001652, A001571, A077262, A077291, A077401, A336625, A341895, A075528, A076139, A077260, A077289, A077399, A336624, A068085, A029549, A076140, A077261, A077290, A077400, A336626, A000217, A341895, A341896.

cp's OEIS Frontend

A341895 Indices of triangular numbers that are ten times other triangular numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A253651 Triangular numbers that are the product of a triangular number and a prime number.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A341893 Indices of triangular numbers that are one-tenth of other triangular numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A112355 Triangular numbers that are the sum of three positive triangular numbers.

Views

Author

Keywords

Comments

Examples

Crossrefs

A341894 For square n > 0, a(n) = 0; for nonsquare n > 0, a(n) is the rank r such that t(r) + t(r-1) = u(r) - u(r-1) - 1, where u(r) and t(r) are indices of some triangular numbers in the Diophantine relation T(u(r)) = n*T(t(r)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A385146 Pentagonal numbers that are five times another pentagonal number.

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI

Formula