The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A026570 a(n)=T(n,n-1), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T such that s(n)=1. 0

%I #6 Jun 23 2013 12:03:02

%S 1,1,4,7,20,43,111,259,648,1565,3885,9533,23662,58547,145630,362151,

%T 903110,2253615,5633359,14094035,35304658,88511733,222115782,

%U 557819793,1401987930,3526066273,8874034647,22346581133,56304982154

%N a(n)=T(n,n-1), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T such that s(n)=1.

%C Also a(n)=T'(n,n-1), T' given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T' such that s(n)=1.

%F Conjecture: (n+1)*a(n) -2*n*a(n-1) +(-3*n-1)*a(n-2) +2*(2*n-3)*a(n-3)=0. - _R. J. Mathar_, Jun 23 2013

%K nonn

%O 1,3

%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 May 14 14:46 EDT 2024. Contains 372533 sequences. (Running on oeis4.)