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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209286 a(n) = a(n-1) + (1+a(n-2))*a(n-3) for n>1, a(1) = 1, a(n) = 0 for n<1. 1
0, 1, 1, 1, 3, 5, 9, 27, 77, 329, 2435, 27845, 829289, 68634299, 23160214349, 56940830227049, 1589642017432217699, 1318763422910513770158149, 90515537555154997905172366725449, 2096361748201801549831377117539292825822299 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..30

FORMULA

a(n) = a(n-1) + (1+a(n-2))*a(n-3) for n>1, a(1) = 1, a(n) = 0 for n<1.

MAPLE

a:= proc(n) a(n):= `if`(n<1, 0,

      `if`(n=1, 1, a(n-1) +(1+a(n-2))*a(n-3)))

    end:

seq(a(n), n=0..20);  # Alois P. Heinz, Feb 20 2013

MATHEMATICA

Rest[RecurrenceTable[{a[-1]==a[0]==0, a[1]==1, a[n]==a[n-1]+(1+a[n-2]) a[n-3]}, a, {n, 20}]] (* Harvey P. Dale, Apr 13 2014 *)

CROSSREFS

Sequence in context: A192152 A217098 A262314 * A082711 A013622 A246666

Adjacent sequences:  A209283 A209284 A209285 * A209287 A209288 A209289

KEYWORD

nonn

AUTHOR

Chris Kunferman, Feb 17 2013

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 22 08:46 EST 2019. Contains 329389 sequences. (Running on oeis4.)