Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A026813

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

Showing entries 1-10 | older changes
Number of partitions of n in which the greatest part is 7.
(history; published version)
#70 by Ray Chandler at Thu Feb 29 14:57:10 EST 2024
STATUS

editing

approved

#69 by Ray Chandler at Thu Feb 29 14:57:05 EST 2024
MATHEMATICA

Drop[LinearRecurrence[{1, 1, 0, 0, -1, 0, -1, -1, 0, 1, 1, 2, 0, 0, 0, -2, -1, -1, 0, 1, 1, 0, 1, 0, 0, -1, -1, 1}, Append[Table[0, {27}], 1], 121], 20] (* _Robert A. Russell_, May 17 2018 *)

-1, -1, 0, 1, 1, 0, 1, 0, 0, -1, -1, 1}, Append[Table[0, {27}], 1], 121], 20] (* Robert A. Russell, May 17 2018 *)

STATUS

approved

editing

#68 by Ray Chandler at Tue Feb 27 10:46:19 EST 2024
STATUS

editing

approved

#67 by Ray Chandler at Tue Feb 27 10:46:15 EST 2024
LINKS

<a href="/index/Rec#order_28">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1, 0, 0, -1, 0, -1, -1, 0, 1, 1, 2, 0, 0, 0, -2, -1, -1, 0, 1, 1, 0, 1, 0, 0, -1, -1, 1).

MATHEMATICA

-1, -1, 0, 1, 1, 0, 1, 0, 0, -1, -1, 1}, Append[Table[0, {27}], 1], 121], 20] (* _Robert A. Russell_, May 17 2018 *)

Append[Table[0, {27}], 1], 121], 20] (* Robert A. Russell, May 17 2018 *)

STATUS

approved

editing

#66 by Charles R Greathouse IV at Thu Sep 08 08:44:49 EDT 2022
PROG

(MAGMAMagma) [#Partitions(n, 7): n in [0..53]]; // Marius A. Burtea, Jul 01 2019

Discussion
Thu Sep 08
08:44
OEIS Server: https://oeis.org/edit/global/2944
#65 by Alois P. Heinz at Wed Sep 01 06:08:19 EDT 2021
FORMULA

From Ayoub Saber Rguez, Aug 27 2021

a(n) = round((1/362880)*n^6 +(1/86400)*n^5 + (1/6480)*n^4 + (7/12960)*n^3 - b(n mod 2)*(1/57600)*n^2 + (1/10368)*c(n mod 6)*n), where b(0)=101 and b(1)=176 and c(0)=-288,c(1)=29,c(2)=-224,c(3)=-99,c(4)=-(51840/234),and c(5)=-35 . (End)

STATUS

editing

approved

#64 by Alois P. Heinz at Tue Aug 31 20:16:53 EDT 2021
STATUS

proposed

editing

Discussion
Tue Aug 31
20:17
Alois P. Heinz: They were rejected before.  So you should not submit them again.
#63 by Ayoub Saber Rguez at Fri Aug 27 08:38:40 EDT 2021
STATUS

editing

proposed

Discussion
Fri Aug 27
08:50
Joerg Arndt: Same as just rejected.
09:16
Ayoub Saber Rguez: why? it's almost the same form accepted in A026812 ?
10:09
Michel Marcus: A026812  formula took lots of discussions and 2 weeks to be approved : for me, not an example to follow ...
10:49
Ayoub Saber Rguez: is there a suitble form for the OEIS? knowing that for this case the exact closed form formula is devided into at most 420 case (generally into at most LCM(2,3,..,k)),this is make the submited formula very shorter (if it's not the shortest), what are the criteria of formula to be acceped?
11:10
Ayoub Saber Rguez: for example for Number of partitions of n in which the greatest part is 5 the accepted formula is 
a(n) = round( ((n^4+10*(n^3+n^2)-75*n -45*n*(-1)^n)) / 2880 )
and it's also
a(n) = round(((n^4+10*(n^3+n^2)-((n mod 2)*(-90)+120)*n)) / 2880 ) 
what makes the first acceptble and the second not?
12:07
Ayoub Saber Rguez: the formula can be  shorter
a(n) = round((1/362880)*n^6 +(1/86400)*n^5 + (1/6480)*n^4 + (7/12960)*n^3 - ((n mod 2)*75+101)(1/57600)*n^2 + (1/10368)*b(n mod 6)*n), where b(0)=-288,b(1)=29,b(2)=-224,b(3)=-99,b(4)=-(51840/234),and b(5)=-35
Tue Aug 31
20:16
Alois P. Heinz: You have a long history of submitting too complicated formulas.
#62 by Ayoub Saber Rguez at Fri Aug 27 08:38:33 EDT 2021
FORMULA

From Ayoub Saber Rguez, Aug 27 2021

a(n) = round((1/362880)*n^6 +(1/86400)*n^5 + (1/6480)*n^4 + (7/12960)*n^3 - b(n mod 2)*(1/57600)*n^2 + (1/10368)*c(n mod 6)*n), where b(0)=101 and b(1)=176 and c(0)=-288,c(1)=29,c(2)=-224,c(3)=-99,c(4)=-(51840/234),and c(5)=-35 . (End)

STATUS

approved

editing

#61 by Peter Luschny at Wed Aug 25 07:00:15 EDT 2021
STATUS

reviewed

approved