The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A025255 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A025255

a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-3)*a(3) for n >= 4.
(history; published version)

#5 by R. J. Mathar at Wed Feb 25 14:57:21 EST 2015

STATUS

editing

approved

#4 by R. J. Mathar at Wed Feb 25 14:57:16 EST 2015

FORMULA

Conjecture: n*a(n) +(-2*n+3)*a(n-1) +5*(-n+3)*a(n-2) +(2*n-9)*a(n-3) +9*(n-6)*a(n-4)=0. - R. J. Mathar, Feb 25 2015

STATUS

approved

editing

#3 by Russ Cox at Fri Mar 30 18:56:03 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

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

KEYWORD

nonn,new

nonn

AUTHOR

Clark Kimberling (ck6@cedar.(AT)evansville.edu)

#1 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999

NAME

a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-3)*a(3) for n >= 4.

DATA

1, 3, 1, 1, 4, 8, 22, 55, 145, 386, 1039, 2837, 7808, 21693, 60697, 170959, 484306, 1379020, 3944780, 11330962, 32668988, 94510169, 274262571, 798153211, 2328830794, 6811354123, 19966156857, 58647721275, 172600025350, 508870577560, 1502795261440

OFFSET

1,2

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6@cedar.evansville.edu)

STATUS

approved