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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A085372 If n = 0 or 1 then a(n) = 1; if n = 2, 3 or 4 then a(n) = 0; otherwise a(n) = (n+1)*a(n-1)-(n-2)*a(n-2)-(n-5)*a(n-3)+(n-3)*a(n-4). 1
 1, 1, 0, 0, 0, 2, 14, 102, 828, 7522, 75706, 836622, 10073824, 131300266, 1841921270, 27673138086, 443343106468, 7544813993618, 135925854199186, 2584491212811038, 51722014716352136, 1086739983701035418, 23919225571408768782, 550360567615450589302 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS This is the same recurrence as A002464 but with different initial values. LINKS Table of n, a(n) for n=0..23. MAPLE A085372 := proc(n) options remember; if n <= 1 then 1 elif n <= 4 then 0 else (n+1)*A085372(n-1)-(n-2)*A085372(n-2)-(n-5)*A085372(n-3)+(n-3)*A085372(n-4); fi; end; CROSSREFS Cf. A002464. Sequence in context: A144277 A037726 A037621 * A123525 A286310 A295865 Adjacent sequences: A085369 A085370 A085371 * A085373 A085374 A085375 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Aug 14 2003 STATUS approved

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

Last modified September 25 02:35 EDT 2023. Contains 365582 sequences. (Running on oeis4.)