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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A259709 a(n) = A259708(n,n-1). 2

%I

%S 0,-1,0,4,22,78,240,679,1828,4762,12132,30432,75504,185875,455040,

%T 1109540,2697698,6545670,15859128,38384099,92832716,224399570,

%U 542226888,1309862496,3163659744,7640066759,18448657344,44545569508,107553559150,259675788510

%N a(n) = A259708(n,n-1).

%H Eric M. Schmidt, <a href="/A259709/b259709.txt">Table of n, a(n) for n = 1..300</a>

%H L. Carlitz, <a href="/A006502/a006502.pdf">Some polynomials related to Fibonacci and Eulerian numbers</a>, Fib. Quart., 16 (1978), 217. (Annotated scanned copy)

%H L. Carlitz, <a href="http://www.fq.math.ca/Scanned/16-3/carlitz1.pdf">Some polynomials related to Fibonacci and Eulerian numbers</a>, Fib. Quart., 16 (1978), 216-226.

%F Empirical: a(n) = 4*a(n-1) - 2*a(n-2) - 6*a(n-3) + 2*a(n-4) + 4*a(n-5) + a(n-6). - _Eric M. Schmidt_, Jul 10 2015

%F Empirical: G.f.: -x^2*(-1+2*x^2+4*x) / ( (x^2+2*x-1)*(x^2+x-1)^2 ). - _R. J. Mathar_, Jul 15 2015

%Y Cf. A259708.

%K sign

%O 1,4

%A _N. J. A. Sloane_, Jul 05 2015

%E More terms from _Eric M. Schmidt_, Jul 10 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 08:38 EDT 2020. Contains 337268 sequences. (Running on oeis4.)