A330988 - cp's OEIS frontend

A330988 a(1)=2, a(2)=3; then a(n+1) = smallest k such that S(k) = S(a(n)) + S(a(n-1)), (n>=2), where S is sopfr (A001414).

n	a(n)
1	2
2	3
3	5
4	15
5	13
6	38
7	93
8	106
9	89
10	695
11	233
12	1492
13	1821
14	3932
15	1597
16	12895
17	16708
18	13526
19	76573
20	70828
21	28657
22	787967
23	1125255
24	4005507
25	6087997
26	10487301
27	514229
28	30784111
29	68658699
30	150301527
31	38770237
32	290846217
33	525964251
34	164233751
35	193262488
36	1368085495
37	1075181473
38	8903068701
39	10762707995
40	4554542743
41	433494437

[2, 3, 5, 15, 13, 38, 93, 106, 89, 695, 233, 1492, 1821, 3932, 1597, 12895, 16708, 13526, 76573, 70828, 28657, 787967, 1125255, 4005507, 6087997, 10487301, 514229, 30784111, 68658699, 150301527, 38770237, 290846217, 525964251, 164233751, 193262488, 1368085495, 1075181473, 8903068701, 10762707995, 4554542743, 433494437]

cp's OEIS Frontend

A330988 a(1)=2, a(2)=3; then a(n+1) = smallest k such that S(k) = S(a(n)) + S(a(n-1)), (n>=2), where S is sopfr (A001414).

Table of values

List of values