This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A213901 #39 May 09 2024 09:09:48
%S A213901 5,7,29,31,79,103,127,149,151,173,197,199,223,269,271,293,317,367,439,
%T A213901 463,487,557,631,701,727,751,773,797,821,823,941,967,991,1039,1061
%N A213901 Fixed points of a sequence that gives the minimum length of a chain of 1,2,1,2,1,... so that the equation n*[n,1,2,1,...,n] = [x,...,y] between terminating continued fractions has a solution with x >= n^2 and y >= n^2.
%C A213901 Let [...,...,...] denote terminating continued fractions. For each n, build the value (quotient) of the continued fraction [n,1,2,1,2,...,n] by inserting the first m terms of the repeated sequence 1,2,1,2,... Note that m may be odd, so the fraction may end with [...,1,n]. Multiply this value by n and convert the product back to a continued fraction [x,...,y]. Define the sequence of minimum m(n) such that x and y in this representation are both at least n^2.
%C A213901 This length sequence m(n) starts 3, 2, 3, 5, 11, 7, 7, 8, 11, 4, 11, 11, 7, 5, 15, 8, 35, 9, 11, 23, 19, 21, 23, 29, 11, 26, 7, 29, 11, ... for n >= 2.
%C A213901 It refers to the equations
%C A213901 2*[2, 1, 2, 1, 2] = [5, 2, 5],
%C A213901 3*[3, 1, 2, 3] = [11, 10],
%C A213901 4*[4, 1, 2, 1, 4] = [18, 1, 18],
%C A213901 5*[5, 1, 2, 1, 2, 1, 5] = [28, 1, 1, 1, 28],
%C A213901 6*[6, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 6] = [40, 2, 1, 1, 4, 1, 1, 2, 40],
%C A213901 7*[7, 1, 2, 1, 2, 1, 2, 1, 7] = [54, 8, 54],
%C A213901 8*[8, 1, 2, 1, 2, 1, 2, 1, 8] = [69, 1, 5, 1, 69],
%C A213901 9*[9, 1, 2, 1, 2, 1, 2, 1, 2, 9] = [87, 1, 1, 2, 3, 84],
%C A213901 10*[10, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 10] = [107, 3, 8, 3, 107],
%C A213901 11*[11, 1, 2, 1, 2, 11] = [129, 125],
%C A213901 12*[12, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 12] = [152, 1, 3, 1, 1, 1, 3, 1, 152],
%C A213901 13*[13, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 13] = [178, 1, 1, 14, 1, 1, 178],
%C A213901 14*[14, 1, 2, 1, 2, 1, 2, 1, 14] = [206, 4, 206], ...
%C A213901 {a(n)} contains the fixed points of the length sequence m, i.e., those n where m(n)=n.
%C A213901 What is surprising is that all these fixed points appear to be prime numbers. (Such a sequence of fixed points may be defined for any other pair (p,q) which defines continued fractions [n,p,q,p,q,...,n]. Here we are looking at p=1, q=2. The sequence m(n) related to the pair p=2, q=1 is 1, 2, 3, 5, 5, 7, 3, 8, 5, 4, 11, 11, 7, 5, 7, 8, ... for n >= 2.)
%C A213901 If we have any sequence of positive integers, we can consider the sequence of primes which divide some term of the sequence. In some cases, this sequence of primes could be finite. For the Fibonacci sequences, the sequence of primes is all primes. If we speak of Fibonacci sequences, we are referring to any sequence which satisfies the recursion relation f(n) = f(n-1) + f(n-2) with arbitrary initial conditions f(1), f(2). Each of these sequences has a set of prime divisors. None of these has the sequence of all primes as its prime sequence, but the intersection of all these sequences of primes is nonempty, and coincides with A000057.
%C A213901 From that perspective, the current sequence seems to relate to the prime divisors common to some family of generalized Fibonacci sequences f(n) = e*f(n-1) + g*f(n-2) for some fixed coefficients e and g.
%H A213901 Bill McEachen, <a href="/A213901/b213901.txt">Table of n, a(n) for n = 1..360</a> (terms 1..157 from Art DuPre)
%o A213901 (PARI)
%o A213901 {a(n,p,q) = local(t, m=1,s=[n]); if( n<2, 0, while( 1,
%o A213901 if(component(Mod(m,2),2)==1, s=concat(s,p),s=concat(s,q));
%o A213901 t=contfracpnqn(concat(s,n));
%o A213901 t = contfrac(n*t[1,1]/t[2,1]);
%o A213901 if(t[1]<n^2 || t[#t]<n^2, m++, break));
%o A213901 m)};
%o A213901 for(k=1,4000,if(k==a(k,1,2),print1(a(k,1,2)","," ")));
%Y A213901 Cf. A213891-A213900.
%K A213901 nonn
%O A213901 1,1
%A A213901 _Art DuPre_, Jun 29 2012