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!)
A026970 a(n) = Sum_{k=0..n} (k+1) * A026637(n,k). 0
1, 3, 8, 25, 60, 147, 336, 765, 1700, 3751, 8184, 17745, 38220, 81915, 174752, 371365, 786420, 1660239, 3495240, 7340025, 15379100, 32156323, 67108848, 139810125, 290805060, 603979767, 1252698776, 2594876065, 5368709100 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..28.

FORMULA

Conjectures from Colin Barker, Feb 18 2016: (Start)

a(n) = -((-1)^n-2^(n+2)+3)*(n+2)/6 for n>0.

a(n) = 4*a(n-1)-2*a(n-2)-8*a(n-3)+7*a(n-4)+4*a(n-5)-4*a(n-6) for n>6.

G.f.: (1-x-2*x^2+7*x^3-7*x^4-4*x^5+4*x^6) / ((1-x)^2*(1+x)^2*(1-2*x)^2).

(End)

CROSSREFS

Sequence in context: A180380 A057420 A076049 * A026980 A026955 A093900

Adjacent sequences:  A026967 A026968 A026969 * A026971 A026972 A026973

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 30 02:41 EDT 2022. Contains 354913 sequences. (Running on oeis4.)