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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025273 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5. 3
1, 0, 1, 1, 2, 5, 12, 29, 72, 182, 466, 1207, 3158, 8334, 22158, 59299, 159614, 431838, 1173710, 3203244, 8774780, 24118522, 66497316, 183858411, 509670494, 1416231616, 3944027402, 11006186760, 30772507128, 86191006746, 241815195292, 679488418879 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

The binomial transform of A025250(n+1) is A025273(n+2). - Paul Barry, May 11 2005

LINKS

Table of n, a(n) for n=1..32.

FORMULA

G.f.: (1-sqrt(1-4x+4x^2-4x^3+4x^4))/(2x); - Paul Barry, May 11 2005

Conjecture: (n+1)*a(n) +2*(-2*n+1)*a(n-1) +4*(n-2)*a(n-2) +2*(-2*n+7)*a(n-3) +4*(n-5)*a(n-4)=0. - R. J. Mathar, Nov 24 2012

CROSSREFS

Sequence in context: A122745 A166292 A010374 * A217333 A089372 A036671

Adjacent sequences:  A025270 A025271 A025272 * A025274 A025275 A025276

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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 20 01:43 EDT 2013. Contains 225445 sequences.