|
%I #7 Apr 28 2016 17:59:17
%S 1,2,3,5,8,13,14,19,24,33,35,44,53,55,63,70,82,98,104,122,142,154,158,
%T 168,176,188,202,222,250,262,264,270,270,302,327,341,372,409,430,439,
%U 459,478,507,545,557,596,636,656,704,710,751,785,794,823,847,886,935
%N a(1)=1, a(2)=2 a(n)=a(n-1)+(a(n-2) mod n).
%F (4*a(n)-n^2)/n^(3/2) is bounded
%t RecurrenceTable[{a[1]==1,a[2]==2,a[n]==a[n-1]+Mod[a[n-2],n]},a,{n,60}] (* _Harvey P. Dale_, Apr 28 2016 *)
%K nonn
%O 1,2
%A _Benoit Cloitre_, Nov 10 2002
|
