This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A026392 T(n,[ n/2 ]), where T is the array in A026386. 4

%I

%S 1,2,4,8,17,34,75,150,339,678,1558,3116,7247,14494,34016,68032,160795,

%T 321590,764388,1528776,3650571,7301142,17501619,35003238,84179877,

%U 168359754,406020930,812041860,1963073865,3926147730

%N T(n,[ n/2 ]), where T is the array in A026386.

%F Conjecture: (n+1)*a(n) +2*(n-1)*a(n-1) +2*(-3*n+1)*a(n-2) +4*(-3*n+7)*a(n-3) +5*(n-3)*a(n-4) +10*(n-5)*a(n-5)=0. - _R. J. Mathar_, Feb 10 2015

%p A026392 := proc(n)

%p A026386(n,floor(n/2)) ;

%p end proc: # _R. J. Mathar_, Feb 10 2015

%Y Cf. A026378, A085362.

%K nonn

%O 1,2

%A _Clark Kimberling_

%E Offset corrected. _R. J. Mathar_, Feb 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.

Last modified February 22 17:35 EST 2019. Contains 320400 sequences. (Running on oeis4.)