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

Revision History for A221578

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

Showing entries 1-10 | older changes
A sum over partitions (q=6), see first comment.
(history; published version)
#19 by Joerg Arndt at Mon Feb 28 01:53:18 EST 2022
STATUS

reviewed

approved

#18 by Michel Marcus at Mon Feb 28 01:02:08 EST 2022
STATUS

proposed

reviewed

#17 by Jon E. Schoenfield at Mon Feb 28 00:33:55 EST 2022
STATUS

editing

proposed

#16 by Jon E. Schoenfield at Mon Feb 28 00:33:53 EST 2022
COMMENTS

Set q=6 and f(m)=q^(m-1)*(q-1), then a(n) is the sum over all partitions P of n over all products prod(Product_{k=1..L, } f(m_k) ) where L is the number of different parts in the partition P = [p_1^m_1, p_2^m_2, ..., p_L^m_L].

Sequences where q is not a prime power are:

STATUS

approved

editing

#15 by Alois P. Heinz at Thu Nov 13 21:19:12 EST 2014
STATUS

editing

approved

#14 by Alois P. Heinz at Thu Nov 13 21:19:08 EST 2014
MAPLE

with (numtheory):

add (add (d*b(d), d=divisors(j)) *a(n-j), j=1..n)/n)

seq (a(n), n=0..30); # Alois P. Heinz, Jan 24 2013

STATUS

approved

editing

#13 by Alois P. Heinz at Mon Feb 17 06:01:55 EST 2014
STATUS

proposed

approved

#12 by Jean-François Alcover at Mon Feb 17 05:09:13 EST 2014
STATUS

editing

proposed

#11 by Jean-François Alcover at Mon Feb 17 05:09:06 EST 2014
MATHEMATICA

b[n_] := Sum[EulerPhi[d]*6^(n/d), {d, Divisors[n]}]/n-1; a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d*b[d], {d, Divisors[j]}]*a[n-j], {j, 1, n}]/n]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Feb 17 2014, after Alois P. Heinz *)

STATUS

approved

editing

#10 by Alois P. Heinz at Thu Jan 24 19:32:56 EST 2013
STATUS

editing

approved