The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A078409

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

#6 by Russ Cox at Fri Mar 30 18:50:29 EDT 2012

EXTENSIONS

More terms from _Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, Dec 28 2002

Discussion

Fri Mar 30

18:50

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

#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

KEYWORD

nonn,easy,new

EXTENSIONS

More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystemsgmail.com), Dec 28 2002

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

FORMULA

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

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+1 into distinct positive integers.

DATA

1, 3, 8, 18, 38, 76, 142, 256, 448, 760, 1260, 2048, 3264, 5120, 7917, 12076, 18200, 27130, 40026, 58499, 84756, 121792, 173682, 245920, 345856, 483330, 671418, 927406, 1274118, 1741521, 2368800, 3207086, 4322816, 5802008, 7755776

OFFSET

0,2

FORMULA

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

CROSSREFS

Bisection of A078408. Cf. A035294, A000009, A078410.

KEYWORD

nonn,easy

AUTHOR

njas, Dec 27 2002

EXTENSIONS

More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Dec 28 2002

STATUS

approved