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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027270 a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A026536. 3

%I #14 Apr 13 2022 01:15:52

%S 2,10,104,420,3786,14826,131264,510576,4508580,17523506,154773696,

%T 602175444,5323519838,20744201142,183586707648,716553432640,

%U 6348284151024,24816637181076,220081449149440,861581808936200,7647723960962932,29978812970646870,266322435212031984

%N a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A026536.

%H G. C. Greubel, <a href="/A027270/b027270.txt">Table of n, a(n) for n = 2..500</a>

%F a(n) = Sum_{k=0..2n-3} A026536(n,k) * A026536(n,k+3).

%t T[n_, k_]:= T[n, k]= If[k==0 || k==2*n, 1, If[k==1 || k==2*n-1, Floor[n/2], If[EvenQ[n], T[n-1, k-2] +T[n-1, k-1] +T[n-1, k], T[n-1, k-2] +T[n-1, k]] ]];

%t Table[Sum[T[n,k]*T[n,k+3], {k,0,2*n-3}], {n,2,40}] (* _G. C. Greubel_, Apr 12 2022 *)

%o (SageMath)

%o @CachedFunction

%o def T(n, k): # A026536

%o if k == 0 or k == 2*n: return 1

%o elif k == 1 or k == 2*n-1: return n//2

%o elif n % 2 == 1: return T(n-1, k-2) + T(n-1, k)

%o return T(n-1, k-2) + T(n-1, k-1) + T(n-1, k)

%o def A027270(n): return sum(T(n,k)*T(n,k+3) for k in (0..2*n-3))

%o [A027270(n) for n in (2..40)] # _G. C. Greubel_, Apr 12 2022

%Y Cf. A026536, A027267, A027268, A027269.

%K nonn

%O 2,1

%A _Clark Kimberling_

%E More terms from _Sean A. Irvine_, Oct 26 2019

%E a(2) = 2 prepended by _G. C. Greubel_, Apr 12 2022

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 05:35 EDT 2024. Contains 371697 sequences. (Running on oeis4.)