A112074 -id:A112074 - cp's OEIS frontend

A112070 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.

3, 5, 7, 11, 9, 23, 13, 15, 25, 49, 19, 17, 47, 71, 121, 21, 31, 73, 119, 311, 169, 27, 33, 95, 191, 551, 479, 289, 29, 39, 97, 239, 671, 1151, 1559, 361, 35, 41, 143, 241, 719, 1319, 2999, 5711, 529, 37, 55, 145, 359, 839, 1679, 3071, 8399, 10559, 841, 43, 57

Offset: 1

Antti Karttunen, Aug 27 2005

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).

			The top left corner of the array:
3,5,11,13,19,21,...
7,9,15,17,31,33,...
23,25,47,73,95,...

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.

A112134 First differences of A112064.

Original entry on oeis.org

11, 24, 36, 24, 1, 59, 25, 11, 25, 59, 1, 24, 36, 24, 11, 49, 11, 24, 36, 24, 1, 59, 25, 11, 25, 59, 1, 24, 36, 24, 11, 49, 11, 24, 36, 24, 1, 59, 25, 11, 25, 59, 1, 24, 36, 24, 11, 49, 11, 24, 36, 24, 1, 59, 25, 11, 25, 59, 1, 24, 36, 24, 11, 49, 11, 24, 36, 24, 1, 59, 25, 11

Offset: 1

Antti Karttunen, Aug 28 2005

nonn

Period=16. Also half of the first differences of A112074. Cf. A112086.

cp's OEIS Frontend

A112070 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.

Views

Author

Keywords

Comments

Examples

Crossrefs

A112134 First differences of A112064.

Views

Author

Keywords

Crossrefs