A269158 -id:A269158 - cp's OEIS frontend

A268728 Square array A(row,col) = B(row,(2*col)-1), where B(p,2q-1) = 0 if gcd(p,2q-1) > 1, and A269158(p,q) otherwise. Array is read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

0, 0, 1, 0, 2, 1, 0, 7, 0, 0, 0, 4, 3, 0, 1, 0, 13, 3, 0, 2, 0, 0, 14, 0, 0, 0, 0, 1, 0, 11, 1, 0, 2, 4, 0, 1, 0, 8, 1, 0, 1, 7, 7, 2, 1, 0, 25, 0, 0, 1, 0, 0, 7, 0, 0, 0, 26, 3, 0, 6, 15, 5, 4, 0, 0, 1, 0, 31, 3, 0, 0, 10, 3, 13, 4, 0, 2, 1, 0, 28, 0, 0, 6, 0, 2, 14, 0, 6, 0, 0, 1, 0, 21, 1, 0, 1, 26, 7, 11, 4, 12, 0, 3, 0, 0

Offset: 1

Antti Karttunen, Feb 19 2016

The array gives the values of bivariate function B(p,q) which is well-defined only when q is odd, thus while here its argument p obtains all integer values from 1 onward, argument q gets only odd numbers 1, 3, 5, 7, 9, ... as its values.

Any row n occurs also as row (4^k * n), for all k >= 0.

			The top left [1 .. 16] x [1 .. 25] section of the array:
  0, 0, 0, 0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0
  1, 2, 7, 4, 13, 14, 11,  8, 25, 26, 31, 28, 21, 22, 19, 16
  1, 0, 3, 3,  0,  1,  1,  0,  3,  3,  0,  1,  1,  0,  3,  3
  0, 0, 0, 0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0
  1, 2, 0, 2,  1,  1,  6,  0,  6,  1,  5,  6,  0,  6,  5,  5
  0, 0, 4, 7,  0, 15, 10,  0, 26, 25,  0, 29, 20,  0, 16, 19
  1, 0, 7, 0,  5,  3,  2,  7,  2,  1,  0,  3,  1,  4,  5,  4
  1, 2, 7, 4, 13, 14, 11,  8, 25, 26, 31, 28, 21, 22, 19, 16
  1, 0, 0, 4,  0,  4,  9,  0, 12,  1,  0,  0, 12,  0,  4,  9
  0, 0, 0, 6, 12, 15, 13,  0, 31, 27, 26, 26,  0, 16, 22, 21
  1, 2, 0, 0, 13,  0,  7, 11, 14, 13, 14,  3,  8, 10, 10, 15
  1, 0, 3, 3,  0,  1,  1,  0,  3,  3,  0,  1,  1,  0,  3,  3
  1, 0, 3, 7,  0, 14,  0,  6,  1, 11, 14,  8,  8,  9, 12, 11
  0, 2, 0, 0,  8, 13,  9, 15, 27, 27,  0, 31, 20, 18, 22, 20
  1, 0, 0, 0,  0,  0, 11,  0,  9,  3,  0, 15,  0,  0,  2, 15
  0, 0, 0, 0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0,  0
  1, 2, 7, 3, 13, 15,  0,  8,  0,  8, 17, 11,  8, 14, 18, 10
  0, 0, 7, 0,  0, 10,  2,  0, 21, 27,  0, 28, 25,  0, 23, 25
  1, 0, 0, 2,  0, 14, 10,  0, 25,  0, 11, 19,  8,  9, 10, 16
  1, 2, 0, 2,  1,  1,  6,  0,  6,  1,  5,  6,  0,  6,  5,  5
  1, 0, 0, 0,  0, 15, 11,  0,  0, 26,  0, 10, 17,  0, 10, 15
  0, 0, 7, 4,  0,  0, 12,  3, 23, 23, 17, 31, 29, 28, 25, 31
  1, 2, 3, 4,  1,  0, 13,  8, 26,  0, 31,  0, 13, 19,  8, 11
  0, 0, 4, 7,  0, 15, 10,  0, 26, 25,  0, 29, 20,  0, 16, 19
  1, 0, 0, 0,  5,  1,  1,  0, 25, 25,  0, 28,  0, 12, 25, 13

Antti Karttunen, Table of n, a(n) for n = 1..32896; the first 256 antidiagonals of the array

Transpose: A268729.
Column 1: Seems to be 0 followed by A039982.
Cf. A065621 (occurs as row 2, row 8, and in general, as any row 2^(2n+1) for n >= 0).
Cf. A268829, A269158 (variants).
Cf. A003188, A003987, A004198.

(define (A268728 n) (A268728bi (A002260 n) (+ -1 (* 2 (A004736 n)))))
(define (A268728bi p q) (if (not (odd? q)) (error "A268728bi: the second argument should be odd: " p q) (let loop ((p p) (q q) (s 0)) (cond ((zero? p) 0) ((= 1 p) s) ((odd? p) (loop (modulo q p) p (A003987bi s (A004198bi p q)))) (else (loop (/ p 2) q (A003987bi s (A003987bi q (/ (- q 1) 2)))))))))
;; Alternative implementation using the definition given in A269158:
(define (A268728 n) (let ((p (A002260 n)) (q (+ -1 (* 2 (A004736 n))))) (if (< 1 (gcd p q)) 0 (A269158auxbi p q))))

A(row,col) = B(row,(2*col)-1), where function B(p,q) [only odd values allowed for q] is defined as: If gcd(p,q) > 1, B(p,q) = 0, otherwise B(p,q) = F(p,q) = A269158(p,(q+1)/2), function F defined as in A269158.

A268829 Square array A(row,col) = B(row,(2col)-1), where B(p,q) = 0 if gcd(p,q) > 1, and 1 + 2F(p,q) otherwise, where F is defined as in A269158. Array is read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Original entry on oeis.org

1, 1, 3, 1, 5, 3, 1, 15, 0, 1, 1, 9, 7, 1, 3, 1, 27, 7, 1, 5, 1, 1, 29, 0, 1, 0, 0, 3, 1, 23, 3, 1, 5, 9, 1, 3, 1, 17, 3, 1, 3, 15, 15, 5, 3, 1, 51, 0, 1, 3, 0, 0, 15, 0, 1, 1, 53, 7, 1, 13, 31, 11, 9, 1, 1, 3, 1, 63, 7, 1, 0, 21, 7, 27, 9, 0, 5, 3, 1, 57, 0, 1, 13, 0, 5, 29, 0, 13, 1, 0, 3, 1, 43, 3, 1, 3, 53, 15, 23, 9, 25, 1, 7, 1, 1

Offset: 1

Antti Karttunen, Feb 20 2016

			The top left [1 .. 16] x [1 .. 25] section of the array:
1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1
3,  5, 15,  9, 27, 29, 23, 17, 51, 53, 63, 57, 43, 45, 39, 33
3,  0,  7,  7,  0,  3,  3,  0,  7,  7,  0,  3,  3,  0,  7,  7
1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1
3,  5,  0,  5,  3,  3, 13,  0, 13,  3, 11, 13,  0, 13, 11, 11
1,  0,  9, 15,  0, 31, 21,  0, 53, 51,  0, 59, 41,  0, 33, 39
3,  1, 15,  0, 11,  7,  5, 15,  5,  3,  0,  7,  3,  9, 11,  9
3,  5, 15,  9, 27, 29, 23, 17, 51, 53, 63, 57, 43, 45, 39, 33
3,  0,  1,  9,  0,  9, 19,  0, 25,  3,  0,  1, 25,  0,  9, 19
1,  1,  0, 13, 25, 31, 27,  0, 63, 55, 53, 53,  0, 33, 45, 43
3,  5,  1,  1, 27,  0, 15, 23, 29, 27, 29,  7, 17, 21, 21, 31
3,  0,  7,  7,  0,  3,  3,  0,  7,  7,  0,  3,  3,  0,  7,  7
3,  1,  7, 15,  1, 29,  0, 13,  3, 23, 29, 17, 17, 19, 25, 23
1,  5,  1,  0, 17, 27, 19, 31, 55, 55,  0, 63, 41, 37, 45, 41
3,  0,  0,  1,  0,  1, 23,  0, 19,  7,  0, 31,  0,  0,  5, 31
1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1
3,  5, 15,  7, 27, 31,  1, 17,  0, 17, 35, 23, 17, 29, 37, 21
1,  0, 15,  1,  0, 21,  5,  0, 43, 55,  0, 57, 51,  0, 47, 51
3,  1,  1,  5,  1, 29, 21,  1, 51,  0, 23, 39, 17, 19, 21, 33
3,  5,  0,  5,  3,  3, 13,  0, 13,  3, 11, 13,  0, 13, 11, 11
3,  0,  1,  0,  0, 31, 23,  0,  1, 53,  0, 21, 35,  0, 21, 31
1,  1, 15,  9,  1,  0, 25,  7, 47, 47, 35, 63, 59, 57, 51, 63
3,  5,  7,  9,  3,  1, 27, 17, 53,  1, 63,  0, 27, 39, 17, 23
1,  0,  9, 15,  0, 31, 21,  0, 53, 51,  0, 59, 41,  0, 33, 39
3,  1,  0,  1, 11,  3,  3,  0, 51, 51,  1, 57,  0, 25, 51, 27

Cf. arrays A268728, A269158.

(define (A268829 n) (let ((p (A002260 n)) (q (+ -1 (* 2 (A004736 n))))) (if (< 1 (gcd p q)) 0 (+ 1 (* 2 (A269158auxbi p q)))))) ;; This one uses the code of A269158.
;; The following is a more stand-alone implementation:
(define (A268829 n) (A268829auxbi (A002260 n) (+ -1 (* 2 (A004736 n)))))
(define (A268829auxbi p q) (if (not (odd? q)) (error "A268829auxbi: the second argument should be odd: " p q) (let loop ((p p) (q q) (s 0)) (cond ((zero? p) 0) ((= 1 p) (+ 1 (* 2 s))) ((odd? p) (loop (modulo q p) p (A003987bi s (A004198bi p q)))) (else (loop (/ p 2) q (A003987bi s (A003987bi q (/ (- q 1) 2)))))))))

A(i,j) = B(i,(2*j)-1), where B(p,q) = 0 if gcd(p,q) > 1, and 1 + 2*F(p,q) = 1 + 2*A269158(p,(q+1)/2) otherwise, where function F is defined as in A269158.

A268819 Column 32769 of array A269158: a(n) = F(n,65537), function F as defined in A269158.

Original entry on oeis.org

0, 98305, 3, 0, 6, 98306, 2, 98305, 12, 98311, 14, 3, 1, 98307, 9, 0, 24, 98317, 24, 6, 16, 98319, 27, 98306, 0, 98304, 23, 2, 30, 98312, 2, 98305, 48, 98329, 0, 12, 52, 98329, 6, 98311, 3, 98321, 3, 14, 14, 98330, 3, 3, 41, 98305, 43, 1, 4, 98326, 45, 98307, 6, 98335, 43, 9, 27, 98307, 19, 0, 27, 98353, 2, 24, 100, 98305, 1

Offset: 1

Antti Karttunen, Feb 25 2016

Terms a(1) .. a(65536) occur as column 32769 in arrays A268728 and A269158.

Antti Karttunen, Table of n, a(n) for n = 1..65536

Cf. A010873, A052928, A165471, A165472.
Cf. arrays A268728 and A269158.
Cf. A269157 (indices of zeros).

;; Two variants, both give same results in range n=1..65536:
(define (A268819 n) (A268728auxbi n 65537))
(define (A268819 n) (A269158auxbi n 65537))

a(n) = F(n,65537) = A269158(n,32769), function F as defined in A269158.
Other identities. For n = 1..65536:
a(n) = A268728(n,32769).
A165471(n) = 1 - A010873(A052928(a(n))).

A268931 Square array: A(i,j) = F(A065091(i),A065091(j)), where F(a,b) is the dyadic function defined in A269158. Array is read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Original entry on oeis.org

3, 3, 2, 3, 5, 0, 1, 2, 7, 2, 1, 1, 7, 0, 0, 3, 6, 3, 0, 3, 2, 3, 6, 2, 11, 7, 7, 0, 1, 1, 2, 7, 14, 3, 0, 2, 3, 6, 1, 14, 13, 15, 2, 3, 2, 3, 5, 3, 13, 1, 0, 14, 4, 0, 0, 1, 5, 5, 3, 11, 17, 10, 0, 0, 0, 0, 3, 2, 4, 10, 8, 8, 25, 13, 3, 3, 7, 2, 3, 1, 1, 15, 12, 11, 19, 26, 1, 4, 4, 0, 0, 1, 2, 6, 1, 11, 18, 19, 0, 3, 6, 0, 7, 3, 2

Offset: 1

Antti Karttunen, Feb 19 2016

			The top left [1 .. 19] x [1 .. 19] section of the array:
3, 3, 3,  1,  1,  3,  3,  1,  3,  3,  1,  3,  3,  1,  3,  1,  1,  3,  1
2, 5, 2,  1,  6,  6,  1,  6,  5,  5,  2,  1,  2,  2,  6,  1,  5,  6,  5
0, 7, 7,  3,  2,  2,  1,  3,  5,  4,  1,  6,  3,  5,  5,  0,  7,  3,  7
2, 0, 0, 11,  7, 14, 13,  3, 10, 15,  1,  7,  4, 10,  5, 11,  6,  3,  2
0, 3, 7, 14, 13,  1, 11,  8, 12, 11,  2,  2,  9,  6,  5, 11,  4, 10, 15
2, 7, 3, 15,  0, 17,  8, 11, 18, 10,  2,  3, 13,  0,  8,  8, 14,  1,  2
0, 0, 2, 14, 10, 25, 19, 19, 10, 16, 26,  2,  2,  2, 18,  9, 17, 24, 24
2, 3, 4,  0, 13, 26,  0, 23,  8, 11, 26, 29,  5,  7, 22, 27, 26,  9, 27
2, 0, 0,  3,  1,  3, 27, 29, 29, 14, 22, 10, 31, 26,  5, 25, 30,  5,  9
0, 0, 3,  4,  6, 27,  3, 28, 19, 31, 22, 28,  8, 15, 10, 31,  2,  6, 14
0, 7, 4,  0,  7,  3, 27, 31, 19, 19, 37, 33, 23, 16, 37, 23, 19, 52, 48
2, 0, 7, 14, 11,  2,  3, 28,  3, 21,  0, 41, 20, 23, 34, 28, 40, 62, 62
0, 3, 0, 15,  0, 12,  1,  6, 22,  3, 54, 61, 43, 43, 29, 43, 27, 62,  0
2, 7, 2,  1, 11,  1,  1,  0, 23,  0, 53, 62,  0, 47, 28, 42, 16,  1, 62
2, 3, 0,  4,  0, 25,  3,  3, 16, 31,  0,  3, 60, 57, 53, 29, 26, 43, 38
2, 0, 3,  0,  2, 25, 26,  8,  0,  4, 54, 53,  0,  1, 44, 59, 31, 37,  2
0, 0, 2, 15,  9, 31,  0, 15,  3, 31, 54,  1, 50, 61, 47, 38, 61, 35, 35
0, 7, 0,  0, 11,  0, 27, 10,  4,  5, 53, 63, 61,  2, 42, 38, 34, 67, 67
2, 0, 0,  1, 10,  3, 27, 28, 12,  9, 53, 63,  3, 57, 35,  1, 38,  0, 71

Antti Karttunen, Table of n, a(n) for n = 1..9591; the first 138 antidiagonals of the array

Transpose: A268932.
Cf. A065091 (the main diagonal).
Cf. A006254, A269158.

(define (A268931 n) (A269158auxbi (A065091 (A002260 n)) (A065091 (A004736 n)))) ;; Code for A269158auxbi given in A269158.

A(i,j) = F(A065091(i),A065091(j)) = A269158(A065091(i),A006254(j)), function F defined as in A269158.

A268816 Row 6 of A269158.

Original entry on oeis.org

0, 1, 4, 7, 12, 15, 10, 11, 26, 25, 30, 29, 20, 21, 16, 19, 48, 51, 54, 55, 62, 61, 58, 57, 40, 41, 44, 47, 36, 39, 34, 35, 98, 97, 102, 101, 108, 109, 104, 107, 120, 123, 126, 127, 118, 117, 114, 113, 80, 81, 84, 87, 92, 95, 90, 91, 74, 73, 78, 77, 68, 69, 64, 67, 192, 195, 198, 199, 206, 205, 202, 201, 216, 217

Offset: 1

Antti Karttunen, Feb 20 2016

nonn

This sequence occurs as each row (4^k * 6) in array A269158, for all k >= 0.

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A269158.

(define (A268816 n) (A269158auxbi 6 (+ n n -1))) ;; Code for A269158auxbi given in A269158. (Function F in its definition).

a(n) = A269158(6,n) = F(6,2n-1), function F defined as in A269158.

A269159 Transpose of A269158.

Original entry on oeis.org

0, 1, 0, 1, 2, 0, 0, 3, 7, 0, 1, 0, 3, 4, 0, 0, 2, 0, 3, 13, 0, 1, 1, 5, 0, 1, 14, 0, 1, 0, 4, 2, 0, 1, 11, 0, 1, 2, 7, 7, 1, 0, 1, 8, 0, 0, 0, 7, 7, 12, 1, 0, 3, 25, 0, 1, 0, 0, 4, 5, 15, 6, 0, 3, 26, 0, 1, 2, 2, 4, 13, 3, 10, 5, 0, 3, 31, 0, 1, 3, 0, 6, 9, 14, 2, 11, 6, 0, 1, 28, 0, 0, 0, 3, 0, 12, 4, 11, 7, 26, 1, 0, 1, 21, 0

Offset: 1

Antti Karttunen, Feb 20 2016

See comments in A269158.

			The top left [1 .. 19] x [1 .. 19] section of the array:
0,  1, 1, 0,  1,  0,  1,  1,  1,  0,  1,  1,  1,  0,  1,  0,  1,  0,  1
0,  2, 3, 0,  2,  1,  0,  2,  0,  0,  2,  3,  0,  2,  0,  0,  2,  2,  0
0,  7, 3, 0,  5,  4,  7,  7,  0,  2,  0,  3,  3,  0,  0,  0,  7,  7,  0
0,  4, 3, 0,  2,  7,  7,  4,  4,  6,  0,  3,  7,  3,  0,  0,  3,  0,  2
0, 13, 1, 0,  1, 12,  5, 13,  9, 12, 13,  1,  0,  8, 12,  0, 13,  4,  0
0, 14, 1, 0,  1, 15,  3, 14,  4, 15, 11,  1, 14, 13,  0,  0, 15, 10, 14
0, 11, 1, 0,  6, 10,  2, 11,  9, 13,  7,  1, 13,  9, 11,  0,  0,  2, 10
0,  8, 3, 0,  5, 11,  7,  8,  5, 13, 11,  3,  6, 15, 15,  0,  8, 13,  0
0, 25, 3, 0,  6, 26,  2, 25, 12, 31, 14,  3,  1, 27,  9,  0, 17, 21, 25
0, 26, 3, 0,  1, 25,  1, 26,  1, 27, 13,  3, 11, 27,  3,  0,  8, 27, 19
0, 31, 1, 0,  5, 30,  5, 31,  0, 26, 14,  1, 14, 26, 14,  0, 17, 31, 11
0, 28, 1, 0,  6, 29,  3, 28,  0, 26,  3,  1,  8, 31, 15,  0, 11, 28, 19
0, 21, 1, 0,  1, 20,  1, 21, 12, 20,  8,  1,  8, 20,  4,  0,  8, 25,  8
0, 22, 3, 0,  6, 21,  4, 22,  9, 16, 10,  3,  9, 18,  8,  0, 14, 31,  9
0, 19, 3, 0,  5, 16,  5, 19,  4, 22, 10,  3, 12, 22,  2,  0, 18, 23, 10
0, 16, 3, 0,  5, 19,  4, 16,  9, 21, 15,  3, 11, 20, 15,  0, 10, 25, 16
0, 49, 1, 0,  2, 48,  3, 49, 13, 51,  1,  1,  3, 50,  2,  0,  1, 60, 26
0, 50, 1, 0,  1, 51,  3, 50, 12, 51, 13,  1,  8, 49,  6,  0,  1, 62,  3
0, 55, 1, 0,  2, 54,  1, 55,  1, 53,  1,  1,  2, 54,  2,  0,  2, 54, 26

Antti Karttunen, Table of n, a(n) for n = 1..8256; the first 128 antidiagonals of the array

Cf. A269158 (transpose), A268729 (variant).

(define (A269159 n) (A269158auxbi (A004736 n) (+ -1 (* 2 (A002260 n))))) ;; Code for A269158auxbi given in A269158.

A268932 Transpose of A268931.

Original entry on oeis.org

3, 2, 3, 0, 5, 3, 2, 7, 2, 1, 0, 0, 7, 1, 1, 2, 3, 0, 3, 6, 3, 0, 7, 7, 11, 2, 6, 3, 2, 0, 3, 14, 7, 2, 1, 1, 2, 3, 2, 15, 13, 14, 1, 6, 3, 0, 0, 4, 14, 0, 1, 13, 3, 5, 3, 0, 0, 0, 0, 10, 17, 11, 3, 5, 5, 1, 2, 7, 3, 3, 13, 25, 8, 8, 10, 4, 2, 3, 0, 0, 4, 4, 1, 26, 19, 11, 12, 15, 1, 1, 3, 2, 3, 7, 0, 6, 3, 0, 19, 18, 11, 1, 6, 2, 1

Offset: 1

Antti Karttunen, Feb 19 2016

See comments in A268931.

			The top left [1 .. 19] x [1 .. 19] section of the array:
3, 2, 0,  2,  0,  2,  0,  2,  2,  0,  0,  2,  0,  2,  2,  2,  0,  0,  2
3, 5, 7,  0,  3,  7,  0,  3,  0,  0,  7,  0,  3,  7,  3,  0,  0,  7,  0
3, 2, 7,  0,  7,  3,  2,  4,  0,  3,  4,  7,  0,  2,  0,  3,  2,  0,  0
1, 1, 3, 11, 14, 15, 14,  0,  3,  4,  0, 14, 15,  1,  4,  0, 15,  0,  1
1, 6, 2,  7, 13,  0, 10, 13,  1,  6,  7, 11,  0, 11,  0,  2,  9, 11, 10
3, 6, 2, 14,  1, 17, 25, 26,  3, 27,  3,  2, 12,  1, 25, 25, 31,  0,  3
3, 1, 1, 13, 11,  8, 19,  0, 27,  3, 27,  3,  1,  1,  3, 26,  0, 27, 27
1, 6, 3,  3,  8, 11, 19, 23, 29, 28, 31, 28,  6,  0,  3,  8, 15, 10, 28
3, 5, 5, 10, 12, 18, 10,  8, 29, 19, 19,  3, 22, 23, 16,  0,  3,  4, 12
3, 5, 4, 15, 11, 10, 16, 11, 14, 31, 19, 21,  3,  0, 31,  4, 31,  5,  9
1, 2, 1,  1,  2,  2, 26, 26, 22, 22, 37,  0, 54, 53,  0, 54, 54, 53, 53
3, 1, 6,  7,  2,  3,  2, 29, 10, 28, 33, 41, 61, 62,  3, 53,  1, 63, 63
3, 2, 3,  4,  9, 13,  2,  5, 31,  8, 23, 20, 43,  0, 60,  0, 50, 61,  3
1, 2, 5, 10,  6,  0,  2,  7, 26, 15, 16, 23, 43, 47, 57,  1, 61,  2, 57
3, 6, 5,  5,  5,  8, 18, 22,  5, 10, 37, 34, 29, 28, 53, 44, 47, 42, 35
1, 1, 0, 11, 11,  8,  9, 27, 25, 31, 23, 28, 43, 42, 29, 59, 38, 38,  1
1, 5, 7,  6,  4, 14, 17, 26, 30,  2, 19, 40, 27, 16, 26, 31, 61, 34, 38
3, 6, 3,  3, 10,  1, 24,  9,  5,  6, 52, 62, 62,  1, 43, 37, 35, 67,  0
1, 5, 7,  2, 15,  2, 24, 27,  9, 14, 48, 62,  0, 62, 38,  2, 35, 67, 71

Antti Karttunen, Table of n, a(n) for n = 1..4186; the first 91 antidiagonals of the array

Transpose: A268931.

Cf. A065091, A269158.

(define (A268932 n) (A269158auxbi (A065091 (A004736 n)) (A065091 (A002260 n)))) ;; Code for A269158auxbi given in A269158.

cp's OEIS Frontend

A268728 Square array A(row,col) = B(row,(2*col)-1), where B(p,2q-1) = 0 if gcd(p,2q-1) > 1, and A269158(p,q) otherwise. Array is read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Scheme

Formula

A268829 Square array A(row,col) = B(row,(2*col)-1), where B(p,q) = 0 if gcd(p,q) > 1, and 1 + 2*F(p,q) otherwise, where F is defined as in A269158. Array is read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Views

Author

Keywords

Examples

Crossrefs

Programs

Scheme

Formula

A268819 Column 32769 of array A269158: a(n) = F(n,65537), function F as defined in A269158.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A268931 Square array: A(i,j) = F(A065091(i),A065091(j)), where F(a,b) is the dyadic function defined in A269158. Array is read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Scheme

Formula

A268816 Row 6 of A269158.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A269159 Transpose of A269158.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Scheme

A268932 Transpose of A268931.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Scheme

A268829 Square array A(row,col) = B(row,(2col)-1), where B(p,q) = 0 if gcd(p,q) > 1, and 1 + 2F(p,q) otherwise, where F is defined as in A269158. Array is read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...