Modular recursion: a(0)=a(1)=a(2)=a(3)=1, thereafter: a(n) equals a(n - 2) + a(n - 3) when n = 0 mod 5, a(n - 1) + a(n - 3) when n = 1 mod 5, a(n - 1) + a(n - 2) when n = 2 mod 5, a(n - 1) + a(n - 4) when n = 3 mod 5, and a(n - 1) + a(n - 2) + a(n - 3) otherwise.
A206012
Modular recursion: a(0)=a(1)=a(2)=a(3)=1, thereafter: a(n) equals a(n - 2) + a(n - 3) when n = 0 mod 5, a(n - 1) + a(n - 3) when n = 1 mod 5, a(n - 1) + a(n - 2) when n = 2 mod 5, a(n - 1) + a(n - 4) when n = 3 mod 5, and a(n - 1) + a(n - 2) + a(n - 3) otherwise.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =2a(6) =3a(7) =5a(8) =8a(9) =16a(10) =13a(11) =21a(12) =34a(13) =50a(14) =105a(15) =84a(16) =134a(17) =218a(18) =323a(19) =675a(20) =541a(21) =864a(22) =1405a(23) =2080a(24) =4349a(25) =3485a(26) =5565a(27) =9050a(28) =13399a(29) =28014
External references
- oeis: A206012