login

Revision History for A066222

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

Showing all changes.
#5 by Jon E. Schoenfield at Mon Dec 26 15:22:22 EST 2016
STATUS

editing

approved

#4 by Jon E. Schoenfield at Mon Dec 26 15:22:19 EST 2016
EXTENSIONS

More terms from _Frank Ellermann, _, Jan 01, 2002

STATUS

approved

editing

#3 by Russ Cox at Fri Mar 30 16:49:17 EDT 2012
AUTHOR

_N. J. A. Sloane (njas(AT)research.att.com), _, Dec 19 2001

Discussion
Fri Mar 30
16:49
OEIS Server: https://oeis.org/edit/global/110
#2 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
KEYWORD

nonn,easy,new

AUTHOR

N. J. A. Sloane (njas, (AT)research.att.com), Dec 19 2001

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

Bisection of A001189.

DATA

1, 9, 75, 763, 9495, 140151, 2390479, 46206735, 997313823, 23758664095, 618884638911, 17492190577599, 532985208200575, 17411277367391103, 606917269909048575, 22481059424730751231, 881687990282453393919

OFFSET

0,2

COMMENTS

a(n) is the number of sets of disjoint pairs that can be chosen from 2*n items. - Ron Zeno (rzeno(AT)hotmail.com), Feb 06 2002

KEYWORD

nonn,easy

AUTHOR

njas, Dec 19 2001

EXTENSIONS

More terms from Frank Ellermann, Jan 01, 2002

STATUS

approved