cp's OEIS Frontend

A217758 Triangular numbers of the form k^2 + k - 1.

%I A217758 #36 Apr 19 2018 09:35:18
%S A217758 1,55,1891,64261,2183005,74157931,2519186671,85578188905,
%T A217758 2907139236121,98757155839231,3354836159297755,113965672260284461,
%U A217758 3871478020690373941,131516287031212429555,4467682281040532230951,151769681268346883422801
%N A217758 Triangular numbers of the form k^2 + k - 1.
%C A217758 Triangular numbers belonging to A028387. - _Bruno Berselli_, Apr 18 2018
%C A217758 Since this sequence lists triangular numbers t such that 4*t + 5 = u^2 and 8*t + 1 = v^2 by definition of triangular numbers, 2*u^2 - 9 = 2*(4*t + 5) - 9 = 8*t + 1 = v^2, that is, sqrt(4*a(n) + 5) is in A075841. - _Altug Alkan_, Apr 18 2018
%H A217758 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (35,-35,1).
%F A217758 From _Giovanni Resta_, Mar 24 2013: (Start)
%F A217758 G.f.: -x*(1 + 20*x + x^2) / ( (x - 1)*(x^2 - 34*x + 1) ).
%F A217758 a(n) = floor(9 * (17 + sqrt(288))^n * (3 - sqrt(8))/32). (End)
%F A217758 a(n) = (A075841(n)^2 - 5)/4. - _Altug Alkan_, Apr 18 2018
%e A217758 Triangular(10) = 55 = 7^2 + 7 - 1, so 55 is in the sequence.
%t A217758 a[1]=1; a[2]=55; a[3]=1891; a[n_] := a[n] = 35*a[n-1] - 35*a[n-2] + a[n-3]; Array[a,20] (* _Giovanni Resta_, Mar 24 2013 *)
%t A217758 Table[Floor@(9 (17 + Sqrt@ 288)^n*(3 - Sqrt@ 8)/32), {n, 0, 16}] (* or *)
%t A217758 CoefficientList[Series[-x (1 + 20 x + x^2)/((x - 1) (x^2 - 34 x + 1)), {x, 0, 16}], x] (* _Michael De Vlieger_, Oct 08 2016 *)
%o A217758 (C)
%o A217758 #include <stdio.h>
%o A217758 typedef unsigned long long U64;
%o A217758 U64 rootPronic(U64 a) {
%o A217758     U64 sr = 1L<<32, s, b;
%o A217758     while (a < sr*(sr-1))  sr>>=1;
%o A217758     for (b = sr>>1; b; b>>=1) {
%o A217758         s = sr+b;
%o A217758         if (a >= s*(s-1))  sr = s;
%o A217758     }
%o A217758     return sr;
%o A217758 }
%o A217758 int main() {
%o A217758   U64 a, i, t;
%o A217758   for (i=0; i < 1L<<32; ++i) {
%o A217758       a = i*(i+1)/2 + 1;
%o A217758       t = rootPronic(a);
%o A217758       if (a == t*(t-1))  printf("%llu %llu %llu\n", i, t, a-1);
%o A217758   }
%o A217758   return 0;
%o A217758 }
%o A217758 (PARI) Vec(x*(1+20*x+x^2)/(1-35*x+35*x^2-x^3)+O(x^66)) \\ _Joerg Arndt_, Mar 25 2013
%Y A217758 Cf. A000217, A028387, A069017, A075841.
%K A217758 nonn,easy
%O A217758 1,2
%A A217758 _Alex Ratushnyak_, Mar 23 2013