The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A193361 a(0)=0, a(1)=0; for n>1, a(n) = a(n-1) + (n-3)*a(n-2) + 1. 3
 0, 0, 1, 2, 4, 9, 22, 59, 170, 525, 1716, 5917, 21362, 80533, 315516, 1281913, 5383622, 23330405, 104084736, 477371217, 2246811730, 10839493637, 53528916508, 270318789249, 1394426035918, 7341439399397, 39413238225512, 215607783811041, 1200938739448842 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..800 FORMULA a(0)=a(1)=0, a(2)=1, a(n) = 2*a(n-1)+(n-4)*a(n-2)-(n-4)*a(n-3). a(n) ~ (sqrt(Pi)+sqrt(2))/2 * n^(n/2-1)*exp(sqrt(n)-n/2-1/4) * (1-17/(24*sqrt(n))). - Vaclav Kotesovec, Dec 27 2012 a(n) = A187044(n-2). - Vaclav Kotesovec, Feb 14 2014 MATHEMATICA RecurrenceTable[{a[1]==0, a[2]==0, a[n]==a[n-1]+(n-4) a[n-2]+1}, a, {n, 30}] PROG (MAGMA) [n le 2 select 0 else Self(n-1)+(n-4)*Self(n-2) + 1: n in [1..30]]; CROSSREFS Cf. A185108, A185109, A185308, A185309, A186738, A186739, A213720. Sequence in context: A046917 A237770 A187044 * A294281 A293854 A271078 Adjacent sequences:  A193358 A193359 A193360 * A193362 A193363 A193364 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Dec 25 2012 STATUS approved

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 January 23 03:15 EST 2022. Contains 350504 sequences. (Running on oeis4.)