cp's OEIS Frontend

A326927 Lexicographically earliest sequence of distinct positive integers such that for any n > 0, a(n+1)/a(n) = p^x * q^y where p and q are two distinct prime numbers and {abs(x), abs(y)} = {1, 2}.

%I A326927 #16 Dec 11 2019 02:35:22
%S A326927 1,12,9,2,24,18,4,3,25,7,84,48,36,8,6,27,15,20,16,28,21,75,33,44,55,
%T A326927 45,10,98,22,50,14,63,35,125,65,52,39,147,51,68,85,153,34,242,26,117,
%U A326927 81,99,77,175,49,5,60,80,64,112,140,105,135,30,40,32,56,42,54
%N A326927 Lexicographically earliest sequence of distinct positive integers such that for any n > 0, a(n+1)/a(n) = p^x * q^y where p and q are two distinct prime numbers and {abs(x), abs(y)} = {1, 2}.
%C A326927 This sequence can be seen as a variant of the knight's tour described in A316667 transposed to the space with infinite dimensions described in A309817; two positions in N^N are at knight's distance if they differ exactly by 2 units alongside some axis and by 1 unit alongside some other axis.
%C A326927 Unlike A316667, this sequence is infinite.
%H A326927 Rémy Sigrist, <a href="/A326927/a326927.gp.txt">PARI program for A326927</a>
%F A326927 n and A001222(a(n)) have opposite parity.
%F A326927 Odd-indexed terms belong to A028260, even-indexed terms belong to A026424.
%e A326927 The first terms, alongside a(n+1)/a(n), are:
%e A326927   n   a(n)  a(n+1)/a(n)
%e A326927   --  ----  -----------
%e A326927    1     1  2^+2 * 3^+1
%e A326927    2    12  2^-2 * 3^+1
%e A326927    3     9  2^+1 * 3^-2
%e A326927    4     2  2^+2 * 3^+1
%e A326927    5    24  2^-2 * 3^+1
%e A326927    6    18  2^+1 * 3^-2
%e A326927    7     4  2^-2 * 3^+1
%e A326927    8     3  3^-1 * 5^+2
%e A326927    9    25  5^-2 * 7^+1
%e A326927   10     7  2^+2 * 3^+1
%o A326927 (PARI) See Links section.
%Y A326927 Cf. A001222, A026424, A028260, A309817, A316667.
%K A326927 nonn
%O A326927 1,2
%A A326927 _Rémy Sigrist_, Oct 22 2019