login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263044 a(1) = a(2) = a(3) = 1; for n>3, a(n) = (a(n-3) + a(n-1))*(a(n-2) + a(n-3)). 0
1, 1, 1, 4, 10, 55, 826, 54340, 47921995, 2643710343286, 126835535679488180710, 335322495784116748418182251685105, 42530809264656915340847577048392358554130713446770436 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
a(n) = (a(n-3) + a(n-1))*(a(n-2) + a(n-3)) for n>=4; a(1)=a(2)=a(3)=1.
MATHEMATICA
RecurrenceTable[{a[1] == a[2] == a[3] == 1, a[n] == (a[n - 3] + a[n - 1]) (a[n - 2] + a[n - 3])}, a, {n, 15}] (* Bruno Berselli, Oct 09 2015 *)
PROG
(PARI) a(n) = if(n<4, 1, (a(n-3)+a(n-1))*(a(n-2)+a(n-3)));
vector(15, n, a(n)) \\ Altug Alkan, Oct 08 2015
(Magma) [n le 3 select 1 else (Self(n-3)+ Self(n-1))*(Self(n-2)+Self(n-3)): n in [1..15]]; // Vincenzo Librandi, Oct 09 2015
CROSSREFS
Sequence in context: A276123 A096423 A276130 * A013589 A367430 A225543
KEYWORD
nonn
AUTHOR
Gianmarco Giordano, Oct 08 2015
EXTENSIONS
More terms from Altug Alkan, Oct 08 2015
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:41 EDT 2024. Contains 371906 sequences. (Running on oeis4.)