A206012 - cp's OEIS frontend

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.

n	a(n)
0	1
1	1
2	1
3	1
4	3
5	2
6	3
7	5
8	8
9	16
10	13
11	21
12	34
13	50
14	105
15	84
16	134
17	218
18	323
19	675
20	541
21	864
22	1405
23	2080
24	4349
25	3485
26	5565
27	9050
28	13399
29	28014
30	22449
31	35848
32	58297
33	86311
34	180456
35	144608
36	230919
37	375527
38	555983
39	1162429
40	931510
41	1487493
42	2419003
43	3581432
44	7487928

[1, 1, 1, 1, 3, 2, 3, 5, 8, 16, 13, 21, 34, 50, 105, 84, 134, 218, 323, 675, 541, 864, 1405, 2080, 4349, 3485, 5565, 9050, 13399, 28014, 22449, 35848, 58297, 86311, 180456, 144608, 230919, 375527, 555983, 1162429, 931510, 1487493, 2419003, 3581432, 7487928]

cp's OEIS Frontend

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.

Table of values

List of values