[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A027731 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of independent subsets of nodes in graph formed from n-fold subdivision of 4-dimensional simplex.
(history; published version)
#4 by Russ Cox at Sat Mar 31 12:34:58 EDT 2012
AUTHOR

_R. H. Hardin (rhhardin(AT)att.net)_

Discussion
Sat Mar 31
12:34
OEIS Server: https://oeis.org/edit/global/875
#3 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
KEYWORD

nonn,new

nonn

AUTHOR

R. H. Hardin (rhhrhhardin(AT)cadenceatt.comnet)

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
KEYWORD

nonn,new

nonn

AUTHOR

R. H. Hardin (rhh@research.att(AT)cadence.com)

#1 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999
NAME

Number of independent subsets of nodes in graph formed from n-fold subdivision of 4-dimensional simplex.

DATA

1, 2, 6, 142, 28406, 256037886, 263782234224708

OFFSET

0,2

KEYWORD

nonn

AUTHOR

R. H. Hardin (rhh@research.att.com)

STATUS

approved