|
%I #12 Aug 13 2017 08:10:54
%S 3,5,7,11,9,23,13,15,25,49,19,17,47,71,121,21,31,73,119,311,169,27,33,
%T 95,191,551,479,289,29,39,97,239,671,1151,1559,361,35,41,143,241,719,
%U 1319,2999,5711,529,37,55,145,359,839,1679,3071,8399,10559,841,43,57
%N Square array A(x,y) = y-th odd number 2i+1 (i>=1) for which A112049(2i+1)=x, or 0 if no such i exists; read by descending antidiagonals.
%C This is a permutation of odd numbers greater than unity provided that the sequence A112046 contains only prime values and every prime occurs infinitely many times there. Because the Jacobi symbol is multiplicative with respect to its modulus, it follows that if n occurs on row i and m occurs on row j, then n*m cannot occur before row min(i,j).
%e The top left corner of the array:
%e 3,5,11,13,19,21,...
%e 7,9,15,17,31,33,...
%e 23,25,47,73,95,...
%Y A(x, y) = 2*A112060(x, y)+1. Transpose: A112071. Column 1: A112052. Row 1: A047621, Row 2: A112072 Row 3: A112073, Row 4: A112074, Row 5: A112075, Row 6: A112076, Row 7: A112077, Row 8: A112078, Row 9: A112079.
%K nonn,tabl
%O 1,1
%A _Antti Karttunen_, Aug 27 2005
|
