[seqfan] GF for A083710 Number of partitions [...]

Joerg Arndt arndt at jjj.de
Mon Jun 8 09:12:46 CEST 2009


Suggest re-title as:
"Number of partitions of n such that smallest summand divides every summand."

GF and code:
? N=22; x='x+O('x^N); Vec(1+sum(n=1,N,x^(n)/eta(x^n)))
[1, 1, 2, 3, 5, 6, 11, 12, 20, 25, 37, 43, 70, 78, 114, 143, 196, 232, 330, 386, 530, 641]

correct?




More information about the SeqFan mailing list