OFFSET
0,7
COMMENTS
This is the 3-term analog of the 2-term recurrence A111288 a(1) = a(2) = a(3) = a(4) = 1. For n>= 5, a(n) = a(n-1)*a(n-3) + a(n-2)*a(n-4). Primes in this sequence include a(n) for n = 6, 7, 9, ... with a(21) and a(22) composite and the sequence growing beyond my ability to efficiently test primality.
FORMULA
a(0) = a(1) = a(2) = a(3) = a(4) = a(5) = 1; for n>5: a(n) = a(n-1)*a(n-4) + a(n-2)*a(n-5) + a(n-3)*a(n-6).
MATHEMATICA
RecurrenceTable[{a[0]==a[1]==a[2]==a[3]==a[4]==a[5]==1, a[n]== a[n-1] a[n-4]+ a[n-2]a[n-5]+a[n-3]a[n-6]}, a, {n, 30}] (* Harvey P. Dale, Oct 30 2013 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, May 14 2006
EXTENSIONS
One additional term (a(20)) from Harvey P. Dale, Oct 30 2013
STATUS
approved