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”).
%I #12 Feb 07 2019 14:44:35
%S 1,2,3,2,3,2,3,4,2,2,3,3,3,2,6,2,4,2,3,3,2,2,3,2,2,7,3,3,3,2,3,4,2,2,
%T 5,2,4,2,3,2,5,3,4,6,2,3,3,5,5,5,3,5,3,3,3,6,2,4,4,2,5,2,2,2,5,3,4,4,
%U 2,5,3,4,3,2,2,4,2,3,3,2,3,2,5,2,3,5,4,2,3,2,5
%N a(m) is the smallest positive integer such that A132422(m,n) = A132422(m,n+a(m)) for all n > some value.
%C Does every sequence A132422(m,n), for fixed m, repeat after some point? If there is a prime > m in A132422(m,n) (for fixed m), then this sequence repeats.
%C Every sequence repeats because its terms are bounded. - _Charlie Neder_, Jan 15 2019
%H Charlie Neder, <a href="/A132423/b132423.txt">Table of n, a(n) for n = 1..1000</a>
%e A132422(8,n) is 1,8,15,14,17,8,15,14,17,8,15,14,17,... So a(8) = 4.
%Y Cf. A132422.
%K nonn
%O 1,2
%A _Leroy Quet_, Aug 20 2007