The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A069405

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

A069405

Half the number of n X 5 binary arrays with a path of adjacent 1's and a path of adjacent 0's from top row to bottom row.
(history; published version)

#13 by OEIS Server at Mon Aug 19 17:13:20 EDT 2024

LINKS

Sean A. Irvine, <a href="/A069405/b069405_1.txt">Table of n, a(n) for n = 1..250</a>

#12 by Alois P. Heinz at Mon Aug 19 17:13:20 EDT 2024

STATUS

proposed

approved

Discussion

Mon Aug 19

17:13

OEIS Server: Installed first b-file as b069405.txt.

#11 by Sean A. Irvine at Mon Aug 19 16:23:27 EDT 2024

STATUS

editing

proposed

#10 by Sean A. Irvine at Mon Aug 19 16:23:16 EDT 2024

DATA

15, 285, 4541, 66579, 944157, 13182673, 182702967, 2522968803, 34777826197, 478971480223, 6593672923115, 90751017499077, 1248904863846397, 17186379018703213, 236498372271010941, 3254365880309197587, 44781833050605593997, 616220311429717310963

LINKS

Sean A. Irvine, <a href="/A069405/b069405_1.txt">Table of n, a(n) for n = 1..250</a>

EXTENSIONS

More terms from Sean A. Irvine, Aug 19 2024

STATUS

approved

editing

#9 by Jon E. Schoenfield at Wed Apr 07 18:47:46 EDT 2021

STATUS

editing

approved

#8 by Jon E. Schoenfield at Wed Apr 07 18:47:45 EDT 2021

AUTHOR

R. H. Hardin, Mar 22 2002.

STATUS

approved

editing

#7 by Russ Cox at Sat Mar 31 12:35:00 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net), _, Mar 22 2002.

Discussion

Sat Mar 31

12:35

OEIS Server: https://oeis.org/edit/global/875

#6 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010

KEYWORD

nonn,new

nonn

AUTHOR

Ron R. H. Hardin (rhhardin(AT)att.net), Mar 22 2002.

#5 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009

KEYWORD

nonn,new

nonn

AUTHOR

Ron Hardin (rhhrhhardin(AT)cadenceatt.comnet), Mar 22 2002.

#4 by N. J. A. Sloane at Fri Sep 29 03:00:00 EDT 2006

NAME

Half the number of n X 5 binary arrays with a path of adjacent 1's and a path of adjacent 0's from top row to bottom row.

KEYWORD

nonn,new

nonn