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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082471 a(1)=1, a(n)=sum(k=1,n-1,F(k)*a(k)) where F(k) denotes the k-th Fibonacci number. 0
1, 1, 2, 6, 24, 144, 1296, 18144, 399168, 13970880, 782369280, 70413235200, 10209919104000, 2389121070336000, 903087764587008000, 551786624162661888000, 545165184672709945344000 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Apr 18 2009: (Start)

a(n+1) = (a(1), a(2),...a(n)) dot (F1, F2,...Fn). Example: a(7) = 1296

= (1, 1, 2, 6, 24, 144) dot (1, 1, 2, 3, 5, 8) = (1 + 1 + 4 + 18 + 120 + 1152). (End)

FORMULA

n>=2 a(n)=(F(n-1)+1)*a(n-1); a(n)= (1/2) *prod(k=1, n-1, F(k)+1)

MAPLE

restart:with (combinat):a:= proc(n) option remember; if n=0 then 1 else mul((fibonacci(j)+1), j=1..n-1) fi end: seq (ceil(a(n)/2), n=1..17); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 29 2009]

CROSSREFS

Sequence in context: A013068 A205182 A191006 * A013010 A009608 A012715

Adjacent sequences:  A082468 A082469 A082470 * A082472 A082473 A082474

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 27 2003

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 February 17 07:41 EST 2012. Contains 205998 sequences.