The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A124174 Sophie Germain triangular numbers tr: 2*tr+1 is also a triangular number. 14

%I

%S 0,1,10,45,351,1540,11935,52326,405450,1777555,13773376,60384555,

%T 467889345,2051297326,15894464365,69683724540,539943899076,

%U 2367195337045,18342198104230,80414957735001,623094791644755,2731741367653000,21166880717817451,92798791542467010

%N Sophie Germain triangular numbers tr: 2*tr+1 is also a triangular number.

%C Sophie Germain triangular numbers are one of an infinite number of triangular number sets tr where 2*tn^2*tr + tn is a triangular number: tr and tn both also being triangular numbers with tn being held constant. For the present numbers, a(n) = tr, 8*(2*tr + 1) + 1 = 16*tr + 9 is also a square, the square root of which is 2*y+1 with y being the argument of the triangular number 2*tr + 1. Now 1/2*(y^2+y) = a^2 + a +1 from the definition of Sophie Germain triangular numbers. Multiply both sides by 4 and subtract 3 to get 2*y^2 + 2*y -3 = 4*a^2 + 4*a +1 (a square). Cf. A124124: Numbers y such that 2*y^2 + 2*y - 3 is a square. The values y are the same y such that 2*y+1 = sqrt(16*tr + 9). - _Kenneth J Ramsey_, Jun 25 2011

%C Values of n such that 2*n+1 and 9*n+1 are both triangular numbers. - _Colin Barker_, Jun 29 2016

%H Vincenzo Librandi, <a href="/A124174/b124174.txt">Table of n, a(n) for n = 1..100</a>

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,34,-34,-1,1).

%F a(n) = (A124124(n)^2 + A124124(n)-2)/4.

%F a(n) = 35*(a(n-2) - a(n-4)) + a(n-6).

%F From Peter Pein, Dec 04 2006: (Start)

%F a(n) = -11/32 + (-3 - 2*sqrt(2))^n/64 + (5*(3 - 2*sqrt(2))^n)/32 + (-3 - 2*sqrt(2))^n/(32*sqrt(2)) - (5*(3 - 2*sqrt(2))^n)/(32*sqrt(2)) + (-3 + 2*sqrt(2))^n/64 - (-3 + 2*sqrt(2))^n/(32*sqrt(2)) + (5*(3 + 2*sqrt(2))^n)/32 + (5*(3 + 2*sqrt(2))^n)/(32*sqrt(2));

%F O.g.f.: (x*(1 + 9*x + x^2))/((1 - x)*(1 - 6*x + x^2)*(1 + 6*x + x^2));

%F E.g.f.: (-22*exp(x) + exp(-3*x+2*x*sqrt(2))*(1-sqrt(2)) - 5*exp(3*x-2*x*sqrt(2))*(-2 + sqrt(2)) + exp(-3*x-2*x*sqrt(2))*(1+sqrt(2)) + 5*exp(3*x+2*x*sqrt(2))*(2+sqrt(2)))/64. (End)

%F a(n) = 34*a(n-2) - a(n-4) + 11. - _Kieren MacMillan_, Nov 08 2008

%F a(n) = a(n-1) + 34*a(n-2) - 34*a(n-3) - a(n-4) + a(n-5) with a(0)=0, a(1)=1, a(2)=10, a(3)=45, a(4)=351. - _Harvey P. Dale_, Sep 28 2011

%F a(n) = x*(x + 1)/2 where x = A216134(n) = (2*A000129(n) + (-1)^n*(A000129(2*floor(n/2) - 1) - (-1)^n)/2). - _Raphie Frank_, Jan 04 2013

%F a(n+2) = 1/2*((3/2*sqrt(8*a(n) + 1) + sqrt(16*a(n) + 9) - 1/2)*(3/2*sqrt(8*a(n) + 1) + sqrt(16*a(n) + 9) + 1/2)); a(0) = 0, a(1) = 1. - _Raphie Frank_, Jan 29 2013

%p a:= n-> (Matrix([[10, 1, 0, 0, 1]]). Matrix(5, (i, j)-> if i=j-1 then 1 elif j=1 then [1, 34, -34, -1, 1][i] else 0 fi)^n)[1, 4]: seq(a(n), n=1..30); # _Alois P. Heinz_, Apr 27 2009

%t LinearRecurrence[{1,34,-34,-1,1}, {0,1,10,45,351},30] (* _Harvey P. Dale_, Sep 28 2011 *)

%o (MAGMA) I:=[0,1,10,45]; [n le 4 select I[n] else 34*Self(n-2)-Self(n-4)+11: n in [1..30]]; // _Vincenzo Librandi_, Sep 29 2011

%o (PARI) a=[0, 1, 10, 45, 351];for(n=5,20,a=concat(a,a[#a]+34*a[#a-1]- 34*a[#a-2]-a[#a-3]+a[#a-4]));a \\ _Charles R Greathouse IV_, Sep 29 2011

%Y Cf. A005384, A077442, A124124.

%Y Cf. A216134, A000129.

%K nice,nonn,easy

%O 1,3

%A _Zak Seidov_, Dec 04 2006

%E More terms from _Alois P. Heinz_, Apr 27 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 4 05:19 EDT 2020. Contains 334815 sequences. (Running on oeis4.)