login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026389 a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=4; also a(n) = T(2n,n-2). 1

%I

%S 1,8,49,272,1440,7428,37730,189808,948909,4724160,23453001,116207424,

%T 575036475,2842936320,14046869575,69378730880,342590699955,

%U 1691519468760,8351553940355,41235710124400,203617691311370,1005560117623204

%N a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=4; also a(n) = T(2n,n-2).

%C Binomial transform of A002694. - _Ross La Haye_, Mar 05 2005

%F Conjecture: (n+2)*a(n) +4*(-3*n-2)*a(n-1) +2*(24*n-19)*a(n-2) +4*(-18*n+43)*a(n-3) +35*(n-4)*a(n-4)=0. - _R. J. Mathar_, May 29 2013

%K nonn

%O 2,2

%A _Clark Kimberling_

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 February 16 21:22 EST 2019. Contains 320199 sequences. (Running on oeis4.)