The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A078406

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

A078406

Number of ways to partition 4*n into distinct positive integers.
(history; published version)

#6 by N. J. A. Sloane at Thu Oct 19 03:14:08 EDT 2017

EXTENSIONS

More terms from _Don Reble (djr(AT)nk.ca), _, Jan 05 2003

Discussion

Thu Oct 19

03:14

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

#5 by Russ Cox at Fri Mar 30 16:49:36 EDT 2012

AUTHOR

_N. J. A. Sloane (njas(AT)research.att.com), _, Dec 27 2002

Discussion

Fri Mar 30

16:49

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

#4 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 27 2002

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

CROSSREFS

a(n) = t(4*n, 0), t as defined in A079211.

KEYWORD

nonn,easy,new

#2 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006

MATHEMATICA

Table[PartitionsQ[4n], {n, 0, 40}]

KEYWORD

nonn,easy,new

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

NAME

Number of ways to partition 4*n into distinct positive integers.

DATA

1, 2, 6, 15, 32, 64, 122, 222, 390, 668, 1113, 1816, 2910, 4582, 7108, 10880, 16444, 24576, 36352, 53250, 77312, 111322, 159046, 225585, 317788, 444793, 618784, 855906, 1177438, 1611388, 2194432, 2974400, 4013544, 5392550, 7215644

OFFSET

0,2

MATHEMATICA

Table[PartitionsQ[4n], {n, 0, 40}]

CROSSREFS

Bisection of A035294. Cf. A078407.

a(n) = t(4*n,0), t as defined in A079211.

KEYWORD

nonn,easy

AUTHOR

njas, Dec 27 2002

EXTENSIONS

More terms from Don Reble (djr(AT)nk.ca), Jan 05 2003

STATUS

approved