login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(1)=1 and a(i+1)=a(i)+9 if a(i)<=35, and a(i+1)=a(i)-35 if a(i)>35.
2

%I #16 May 10 2020 14:27:45

%S 1,10,19,28,37,2,11,20,29,38,3,12,21,30,39,4,13,22,31,40,5,14,23,32,

%T 41,6,15,24,33,42,7,16,25,34,43,8,17,26,35,44,9,18,27,36,1,10,19,28,

%U 37,2,11,20,29,38,3,12,21,30,39,4,13,22,31,40,5,14,23,32,41,6,15,24,33,42,7,16,25,34,43,8,17

%N a(1)=1 and a(i+1)=a(i)+9 if a(i)<=35, and a(i+1)=a(i)-35 if a(i)>35.

%C Infinite cyclic sequence with a(44*j+k)=a(k) and 0 < k < 45 with all and only one time the 44th first integers > 0.

%C Periodic with period = 44. - _Harvey P. Dale_, Nov 04 2019

%H <a href="/index/Rec#order_44">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%p A089756 := proc(n)

%p option remember;

%p if n = 1 then

%p 1;

%p else

%p if procname(n-1) > 35 then

%p procname(n-1)-35 ;

%p else

%p procname(n-1)+9 ;

%p end if;

%p end if;

%p end proc:

%p seq(A089756(n),n=1..100) ; # _R. J. Mathar_, Feb 28 2019

%t NestList[If[#<36,#+9,#-35]&,1,80] (* _Harvey P. Dale_, Nov 04 2019 *)

%K nonn,easy,less

%O 1,2

%A _Pierre CAMI_, Jan 08 2004