A081420 - cp's OEIS frontend

A081420 Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)X^2-a(3n-1)*X+a(3n)=0.

n	a(n)
1	0
2	1
3	1
4	1
5	1
6	1
7	4
8	18
9	19
10	5
11	25
12	31
13	11
14	64
15	89
16	4
17	24
18	31
19	29
20	184
21	236
22	45
23	285
24	319
25	76
26	486
27	499
28	121
29	759
30	639
31	199
32	1230
33	855
34	20
35	120
36	59
37	521
38	3038
39	916
40	841
41	4727
42	341
43	1364
44	7386
45	1189
46	2205
47	11445
48	4889

[0, 1, 1, 1, 1, 1, 4, 18, 19, 5, 25, 31, 11, 64, 89, 4, 24, 31, 29, 184, 236, 45, 285, 319, 76, 486, 499, 121, 759, 639, 199, 1230, 855, 20, 120, 59, 521, 3038, 916, 841, 4727, 341, 1364, 7386, 1189, 2205, 11445, 4889]

cp's OEIS Frontend

A081420 Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)X^2-a(3n-1)*X+a(3n)=0.

Table of values

List of values

cp's OEIS Frontend

A081420 Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)*F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)*X^2-a(3n-1)*X+a(3n)=0.

Table of values

List of values

A081420 Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)X^2-a(3n-1)*X+a(3n)=0.