A105669 - cp's OEIS frontend

A105669 A "fractal" transform of the Fibonacci numbers F(n)=A000045(n): a(1)=1, then for n>1 if F(n) < k < F(n+1) we have a(k) = F(n+1)-a(k-F(n)) and when k = F(n+1) we force a(F(n+1)) = F(n+1) + (1+(-1)^n)*F(n).

n	a(n)
1	1
2	2
3	2
4	4
5	7
6	7
7	6
8	6
9	12
10	11
11	11
12	9
13	20
14	20
15	19
16	19
17	17
18	14
19	14
20	15
21	15
22	33
23	32
24	32
25	30
26	27
27	27
28	28
29	28
30	22
31	23
32	23
33	25
34	54
35	54
36	53
37	53
38	51
39	48
40	48
41	49
42	49
43	43
44	44
45	44
46	46
47	35
48	35
49	36
50	36
51	38
52	41
53	41
54	40
55	40
56	88
57	87
58	87
59	85
60	82
61	82
62	83
63	83
64	77
65	78
66	78
67	80
68	69
69	69
70	70
71	70
72	72

[1, 2, 2, 4, 7, 7, 6, 6, 12, 11, 11, 9, 20, 20, 19, 19, 17, 14, 14, 15, 15, 33, 32, 32, 30, 27, 27, 28, 28, 22, 23, 23, 25, 54, 54, 53, 53, 51, 48, 48, 49, 49, 43, 44, 44, 46, 35, 35, 36, 36, 38, 41, 41, 40, 40, 88, 87, 87, 85, 82, 82, 83, 83, 77, 78, 78, 80, 69, 69, 70, 70, 72]

cp's OEIS Frontend

A105669 A "fractal" transform of the Fibonacci numbers F(n)=A000045(n): a(1)=1, then for n>1 if F(n) < k < F(n+1) we have a(k) = F(n+1)-a(k-F(n)) and when k = F(n+1) we force a(F(n+1)) = F(n+1) + (1+(-1)^n)*F(n).

Table of values

List of values

n	a(n)
1	1
2	2
3	2
4	4
5	7
6	7
7	6
8	6
9	12
10	11
11	11
12	9
13	20
14	20
15	19
16	19
17	17
18	14
19	14
20	15
21	15
22	33
23	32
24	32
25	30
26	27
27	27
28	28
29	28
30	22
31	23
32	23
33	25
34	54
35	54
36	53
37	53
38	51
39	48
40	48
41	49
42	49
43	43
44	44
45	44
46	46
47	35
48	35
49	36
50	36
51	38
52	41
53	41
54	40
55	40
56	88
57	87
58	87
59	85
60	82
61	82
62	83
63	83
64	77
65	78
66	78
67	80
68	69
69	69
70	70
71	70
72	72

n	a(n)
1	1
2	2
3	2
4	4
5	7
6	7
7	6
8	6
9	12
10	11
11	11
12	9
13	20
14	20
15	19
16	19
17	17
18	14
19	14
20	15
21	15
22	33
23	32
24	32
25	30
26	27
27	27
28	28
29	28
30	22
31	23
32	23
33	25
34	54
35	54
36	53
37	53
38	51
39	48
40	48
41	49
42	49
43	43
44	44
45	44
46	46
47	35
48	35
49	36
50	36
51	38
52	41
53	41
54	40
55	40
56	88
57	87
58	87
59	85
60	82
61	82
62	83
63	83
64	77
65	78
66	78
67	80
68	69
69	69
70	70
71	70
72	72

n	a(n)
1	1
2	2
3	2
4	4
5	7
6	7
7	6
8	6
9	12
10	11
11	11
12	9
13	20
14	20
15	19
16	19
17	17
18	14
19	14
20	15
21	15
22	33
23	32
24	32
25	30
26	27
27	27
28	28
29	28
30	22
31	23
32	23
33	25
34	54
35	54
36	53
37	53
38	51
39	48
40	48
41	49
42	49
43	43
44	44
45	44
46	46
47	35
48	35
49	36
50	36
51	38
52	41
53	41
54	40
55	40
56	88
57	87
58	87
59	85
60	82
61	82
62	83
63	83
64	77
65	78
66	78
67	80
68	69
69	69
70	70
71	70
72	72