[seqfan] a(n) divides [a(n+1)+(n+1)]

[Eric Angelini]

Hello SeqFans,
the (roller-coaster?) graph of G looks 
promising:

G=1,2,3,5,10,4,9,19,29,48,37,25,12,22,7,

G is always extended with the smallest
unused integer such that a(n) 
divides [a(n+1)+(n+1)]

Examples:

1 div 2+2=4
2 div 3+3=6
3 div 4+5=9
5 div 5+10=15
10 div 6+4=10
4 div 7+9=16
9 div 8+19=27
19 div 9+29=38
29 div 10+48=58
48 div 11+37=48
37 div 12+25=37
25 div 13+12=25
12 div 14+22=36
22 div 15+7=22
7 div 15+...

Best and good night -- last post 
for today, Olivier!-)
É.
Catapulté de mon aPhone