The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A026975

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A026975

a(n) = Sum_{k=0..n} (k+1) * A026648(n,k).
(history; published version)

#12 by Alois P. Heinz at Sun Oct 20 19:48:54 EDT 2019

STATUS

proposed

approved

#11 by Sean A. Irvine at Sun Oct 20 18:55:00 EDT 2019

STATUS

editing

proposed

#10 by Sean A. Irvine at Sun Oct 20 18:54:55 EDT 2019

NAME

a(n) = Sum_{(k+1)*T(=0..n,k)}, 0<= (k<=n, T given by +1) * A026648(n,k).

STATUS

approved

editing

#9 by Joerg Arndt at Fri Feb 19 05:00:41 EST 2016

STATUS

reviewed

approved

#8 by Joerg Arndt at Thu Feb 18 12:10:03 EST 2016

STATUS

proposed

reviewed

#7 by Colin Barker at Thu Feb 18 12:06:12 EST 2016

STATUS

editing

proposed

#6 by Colin Barker at Thu Feb 18 12:05:51 EST 2016

FORMULA

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

a(n) = 8*a(n-2)-12*a(n-4)-16*a(n-6)-4*a(n-8) for n>7.

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

(End)

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 18:56:12 EDT 2012

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Clark Kimberling

Discussion

Fri Mar 30

18:56

OEIS Server: https://oeis.org/edit/global/285

#4 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005

NAME

a(n) = SUMSum{(k+1)*T(n,k)}, 0<=k<=n, T given by A026648.

KEYWORD

nonn,new

nonn

#3 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003

KEYWORD

nonn,new

nonn

AUTHOR

Clark Kimberling, (ck6(AT)evansville.edu)