login

Revision History for A035974

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

Showing all changes.
Number of partitions of n into parts not of the form 19k, 19k+5 or 19k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1.
(history; published version)
#8 by Vaclav Kotesovec at Thu May 10 03:13:07 EDT 2018
STATUS

editing

approved

#7 by Vaclav Kotesovec at Thu May 10 03:13:02 EDT 2018
FORMULA

a(n) ~ exp(4*Pi*sqrt(2*n/57)) * 2^(3/4) * cos(9*Pi/38) / (3^(1/4) * 19^(3/4) * n^(3/4)). - Vaclav Kotesovec, May 10 2018

MATHEMATICA

nmax = 60; Rest[CoefficientList[Series[Product[(1 - x^(19*k))*(1 - x^(19*k+ 5-19))*(1 - x^(19*k- 5))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]] (* Vaclav Kotesovec, May 10 2018 *)

STATUS

approved

editing

#6 by Russ Cox at Fri Mar 30 17:20:48 EDT 2012
AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

Olivier GĂ©rard

Discussion
Fri Mar 30
17:20
OEIS Server: https://oeis.org/edit/global/117
#5 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
KEYWORD

nonn,easy,new

AUTHOR

Olivier Gerard (ogerardolivier.gerard(AT)ext.jussieugmail.frcom)

#4 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005
NAME

Number of partitions of n into parts not of the form 19k, 19k+5 or 19k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1.

KEYWORD

nonn,easy,new

#3 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004
NAME

Partitions in Number of partitions of n into parts not of the kind form 19k, 19k+5 or 19k-5. Also partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1.

KEYWORD

nonn,easy,new

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

nonn,easy,part,new

AUTHOR

Olivier Gerard (ogerard@(AT)ext.jussieu.fr)

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

Partitions in parts not of the kind 19k, 19k+5 or 19k-5. Also partitions with at most 4 parts of size 1 and differences between parts at distance 8 are greater than 1.

DATA

1, 2, 3, 5, 6, 10, 13, 19, 25, 35, 45, 62, 79, 104, 133, 173, 217, 279, 348, 440, 546, 683, 840, 1043, 1275, 1567, 1907, 2328, 2815, 3416, 4111, 4957, 5940, 7125, 8498, 10148, 12055, 14327, 16959, 20075, 23673, 27920, 32816, 38562, 45185, 52923

OFFSET

1,2

COMMENTS

Case k=9,i=5 of Gordon Theorem.

REFERENCES

G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.

KEYWORD

nonn,easy,part

AUTHOR

Olivier Gerard (ogerard@ext.jussieu.fr)

STATUS

approved