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

 

Logo

The OEIS Foundation is grateful to everyone who made a donation during our Annual Appeal.     Visit the new and spectacular Pictures from the OEIS page!

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001064 a(n) = a(n-1)a(n-2) + a(n-3).
(Formerly M0859 N0328)
1
1, 1, 0, 1, 1, 1, 2, 3, 7, 23, 164, 3779, 619779, 2342145005, 1451612289057674, 3399886472013047316638149, 4935316984175079105557291745555191750431, 16779517449593082173916263081219908459297087421776218065830849893 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..22

MATHEMATICA

t = {1, 1, 0}; Do[AppendTo[t, t[[-1]] * t[[-2]] + t[[-3]]], {n, 3, 20}]; t (* T. D. Noe, Jun 25 2012 *)

PROG

(Haskell)

a001064 n = a001064_list !! n

a001064_list = 1 : 1 : 0 : zipWith (+) a001064_list

   (tail $ zipWith (*) a001064_list (tail a001064_list))

-- Reinhard Zumkeller, Dec 30 2011

CROSSREFS

Sequence in context: A098544 A176706 A090253 * A108176 A111235 A066356

Adjacent sequences:  A001061 A001062 A001063 * A001065 A001066 A001067

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, R. K. Guy

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified February 10 10:06 EST 2016. Contains 268149 sequences.