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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141520 a(n)=a(n-1)*a(n-2)+a(n-2)*a(n-3). 0
0, 1, 1, 1, 2, 3, 8, 30, 264, 8160, 2162160, 17645379840, 38152152118080000, 673209215875134265982054400, 25684380411361480419900838705211915059200000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

REFERENCES

Martin Gardner, Mathematical Circus,Randon House, New York, 1981,p 165

http://math.fullerton.edu/mathews/software/Matlab2004.zip

LINKS

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

MATHEMATICA

t={0, 1, 1}; Do[AppendTo[t, t[[-3]]*t[[-2]]+t[[-2]]*t[[-1]]], {n, 13}]; t (* Vladimir Joseph Stephan Orlovsky, Feb 03 2012 *)

PROG

MatLab program:

function y=fib(n)

%Generates running geometric numbers

fz(1)=0; fz(2)=1; fz(3)=1;

for k=4:n

fz(k)=fz(k-2)*(fz(k-1)+fz(k-3));

end

y=fz(n);

CROSSREFS

Sequence in context: A054104 A053556 A001048 * A072042 A160586 A162074

Adjacent sequences:  A141517 A141518 A141519 * A141521 A141522 A141523

KEYWORD

nonn

AUTHOR

Matt Wynne (matwyn(AT)verizon.net), Aug 11 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 03:54 EST 2016. Contains 278698 sequences.