login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026571 a(n)=T(n,n-2), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=2. 0
1, 2, 7, 16, 44, 106, 273, 672, 1696, 4214, 10573, 26392, 66151, 165578, 415277, 1041480, 2615004, 6568450, 16512355, 41531360, 104526093, 263206638, 663143211, 1671581968, 4215574482, 10635988422, 26846320149, 67790042264 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

LINKS

Table of n, a(n) for n=2..29.

FORMULA

Conjecture: (n+2)*a(n) +3*(-n-1)*a(n-1) -3*n*a(n-2) +11*(n-1)*a(n-3) +2*(n-6)*a(n-4) +4*(-2*n+7)*a(n-5)=0. - R. J. Mathar, Jun 23 2013

CROSSREFS

Sequence in context: A113224 A178945 A309561 * A100099 A164267 A184352

Adjacent sequences:  A026568 A026569 A026570 * A026572 A026573 A026574

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 14:27 EST 2019. Contains 329896 sequences. (Running on oeis4.)