The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A279968 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A279968

Square array read by antidiagonals upwards in which each term is the number of prior elements in the same row, column, diagonal, or antidiagonal whose parity is not the same as the parity of n.
(history; published version)

#23 by N. J. A. Sloane at Tue Dec 27 13:09:56 EST 2016

STATUS

proposed

approved

#22 by Peter Kagey at Tue Dec 27 12:38:51 EST 2016

STATUS

editing

proposed

#21 by Peter Kagey at Tue Dec 27 12:38:48 EST 2016

PROG

a279968_list = 0 : map count [21..] where

STATUS

proposed

editing

#20 by Peter Kagey at Tue Dec 27 12:38:12 EST 2016

STATUS

editing

proposed

#19 by Peter Kagey at Tue Dec 27 12:37:56 EST 2016

PROG

(Haskell)

a279968 n = genericIndex a279968_list (n - 1)

a279968_list = 0 : map count [2..] where

count n = genericLength $ filter (odd . (n+)) adjacentLabels where

adjacentLabels = map a279968 (a274080_row n)

STATUS

reviewed

editing

#18 by Joerg Arndt at Tue Dec 27 03:23:09 EST 2016

STATUS

proposed

reviewed

Discussion

Tue Dec 27

03:23

Joerg Arndt: Can you add a program?

#17 by Peter Kagey at Mon Dec 26 19:53:05 EST 2016

STATUS

editing

proposed

#16 by Peter Kagey at Mon Dec 26 19:53:01 EST 2016

LINKS

Peter Kagey, <a href="/A279968/b279968.txt">Table of n, a(n) for n = 1..5000</a>

STATUS

approved

editing

#15 by N. J. A. Sloane at Sat Dec 24 19:49:45 EST 2016

STATUS

editing

approved

#14 by N. J. A. Sloane at Sat Dec 24 19:49:43 EST 2016

CROSSREFS

Cf. also A279211, A279212.

STATUS

approved

editing