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!)
A026289 a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 3, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also a(n) = T(n,n-3), where T is the array in A026268. 1

%I #7 Sep 24 2019 22:20:12

%S 1,3,9,27,79,229,659,1889,5402,15430,44054,125786,359296,1026936,

%T 2937444,8409540,24097737,69118635,198442329,570286939,1640469427,

%U 4723363073,13612376671,39265012213,113358893147,327545797361,947203621523,2741308151929,7939698087777

%N a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 3, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also a(n) = T(n,n-3), where T is the array in A026268.

%F G.f.: 16*z^3*(1-z)*(1-z^2)/[1-z+sqrt(1-2*z-3*z^2)]^4.

%Y Pairwise sums of A026124.

%K nonn

%O 3,2

%A _Clark Kimberling_

%E a(27) corrected and more terms from _Sean A. Irvine_, Sep 24 2019

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 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)