|
|
|
|
|
|
|
|
|
#25 by N. J. A. Sloane at Thu Jan 30 21:29:15 EST 2020
|
|
| FORMULA
|
D-finite with recurrence: n*a(n) = 4*(2*n-1)*a(n-1) + 8*(n-1)*a(n-2). - Vaclav Kotesovec, Oct 17 2012
|
|
|
|
|
Discussion
|
| Thu Jan 30
| 21:29
| OEIS Server: https://oeis.org/edit/global/2847
|
|
|
|
|
|
|
#24 by R. J. Mathar at Mon Jan 20 05:20:15 EST 2020
|
|
|
|
|
|
|
|
#23 by R. J. Mathar at Mon Jan 20 05:20:11 EST 2020
|
|
| FORMULA
|
RecurrenceD-finite: n*a(n) = 4*(2*n-1)*a(n-1) + 8*(n-1)*a(n-2). - Vaclav Kotesovec, Oct 17 2012
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#22 by Susanna Cuyler at Wed Jul 17 17:59:24 EDT 2019
|
|
|
|
|
|
|
|
#21 by Michael De Vlieger at Wed Jul 17 15:33:48 EDT 2019
|
|
|
|
|
|
|
|
#20 by Michael De Vlieger at Wed Jul 17 15:33:46 EDT 2019
|
|
| LINKS
|
Hacène Belbachir, Abdelghani Mehdaoui, László Szalay, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL22/Szalay/szalay42.html">Diagonal Sums in the Pascal Pyramid, II: Applications</a>, J. Int. Seq., Vol. 22 (2019), Article 19.3.5.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#19 by Bruno Berselli at Tue May 14 04:49:30 EDT 2013
|
|
|
|
|
|
|
|
#18 by Vincenzo Librandi at Mon May 13 16:11:11 EDT 2013
|
|
|
|
|
|
|
|
#17 by Vincenzo Librandi at Mon May 13 16:11:04 EDT 2013
|
|
| LINKS
|
Tony D. Noe, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL9/Noe/noe35.html">On the Divisibility of Generalized Central Trinomial Coefficients</a>, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.7.
Tony D. Noe, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL9/Noe/noe35.html">On the Divisibility of Generalized Central Trinomial Coefficients</a>, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.7.
|
|
|
|
|
|
|
#16 by Vincenzo Librandi at Mon May 13 16:10:40 EDT 2013
|
|
| LINKS
|
Vincenzo Librandi, <a href="/A106258/b106258.txt">Table of n, a(n) for n = 0..200</a>
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
