A078113 - cp's OEIS frontend

A078113 Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)abs(2u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that Sum_{k>=1} u(k) is an integer.

n	a(n)
1	2
2	6
3	7
4	15
5	17
6	33
7	37
8	69
9	77
10	141
11	157
12	285
13	317
14	573
15	637
16	1149
17	1277
18	2301
19	2557
20	4605
21	5117
22	9213
23	10237
24	18429
25	20477
26	36861
27	40957
28	73725
29	81917
30	147453
31	163837
32	294909
33	327677
34	589821
35	655357
36	1179645
37	1310717
38	2359293
39	2621437
40	4718589
41	5242877

[2, 6, 7, 15, 17, 33, 37, 69, 77, 141, 157, 285, 317, 573, 637, 1149, 1277, 2301, 2557, 4605, 5117, 9213, 10237, 18429, 20477, 36861, 40957, 73725, 81917, 147453, 163837, 294909, 327677, 589821, 655357, 1179645, 1310717, 2359293, 2621437, 4718589, 5242877]

cp's OEIS Frontend

A078113 Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)abs(2u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that Sum_{k>=1} u(k) is an integer.

Table of values

List of values

cp's OEIS Frontend

A078113 Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)*abs(2*u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that Sum_{k>=1} u(k) is an integer.

Table of values

List of values

A078113 Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)abs(2u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that Sum_{k>=1} u(k) is an integer.