Let m>k>0 be odd numbers and denote by the symbol "m<->k" the value A000265(m-k). Then the sequence m<->k, m<->(m<->k), m<->(m<->(m<->k)),... is periodic; a(n) is the smallest period in the case m=2*n-1, k=1.
1, 1, 2, 1, 3, 3, 2, 1, 5, 2, 6, 5, 5, 7, 2, 1, 6, 9, 6, 3, 3, 6, 12, 10, 4, 13, 10, 3, 15, 15, 2
3 seqfan posts
Mon Jul 19 10:27:05 CEST 2010 [seqfan] Re: Pseudo-arithmetic progressions