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!)
A026547 a(n) = T(n, floor(n/2)), T given by A026536. 2

%I #8 Apr 12 2022 01:35:27

%S 1,1,1,1,5,6,16,19,65,79,251,306,1016,1247,4117,5069,16913,20889,

%T 69865,86479,290455,360205,1212905,1506462,5085224,6324176,21389824,

%U 26630423,90226449,112439094,381519416,475838291,1616684241,2017827545

%N a(n) = T(n, floor(n/2)), T given by A026536.

%H G. C. Greubel, <a href="/A026547/b026547.txt">Table of n, a(n) for n = 0..340</a>

%F a(n) = A026536(n, floor(n/2)).

%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[T[n, Floor[n/2]], {n,0,40}] (* _G. C. Greubel_, Apr 11 2022 *)

%o (SageMath)

%o @CachedFunction

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

%o if k < 0 or n < 0: return 0

%o elif 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 A026547(n): return T(n, n//2)

%o [A026547(n) for n in (0..40)] # _G. C. Greubel_, Apr 11 2022

%Y Cf. A026536.

%K nonn

%O 0,5

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)