login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A302300 a(n) = Sum_{p in P} (Sum_{k_j = 1} 1)^2, where P is the set of partitions of n, and the k_j are the frequencies in p. 2
0, 1, 1, 5, 6, 12, 21, 33, 50, 79, 116, 169, 246, 346, 487, 675, 927, 1254, 1702, 2263, 3014, 3966, 5210, 6766, 8795, 11303, 14531, 18521, 23583, 29803, 37654, 47231, 59206, 73792, 91867, 113778, 140788, 173377, 213289, 261318, 319764, 389846, 474745, 576164 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

This sequence is part of the contribution to the b^2 term of C_{1-b,2}(q) for(1-b,2)-colored partitions - partitions in which we can label parts any of an indeterminate 1-b colors, but are restricted to using only 2 of the colors per part size. This formula is known to match the Han/Nekrasov-Okounkov hooklength formula truncated at hooks of size two up to the linear term in b.

It is of interest to enumerate and determine specific characteristics of partitions of n, considering each partition individually.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..4000

Guo-Niu Han, The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications, arXiv:0805.1398 [math.CO], 2008.

Guo-Niu Han, The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications, Annales de l'institut Fourier, Tome 60 (2010) no. 1, pp. 1-29.

W. J. Keith, Restricted k-color partitions, Ramanujan Journal (2016) 40: 71.

FORMULA

a(n) = Sum_{p in P} (Sum_{k_j = 1} 1)^2, where P is the set of partitions of n, and k_j are the frequencies in p.

EXAMPLE

For a(6), we sum over partitions of six. For each partition, we count 1 for each part which appears once, then square the total in each partition.

6............1^2 = 1

5,1..........2^2 = 4

4,2..........2^2 = 4

4,1,1........1^2 = 1

3,3..........0^2 = 0

3,2,1........3^2 = 9

3,1,1,1......1^2 = 1

2,2,2........0^2 = 0

2,2,1,1......0^2 = 0

2,1,1,1,1....1^2 = 1

1,1,1,1,1,1..0^2 = 0

--------------------

Total.............21

MAPLE

b:= proc(n, i, p) option remember; `if`(n=0 or i=1, (

      `if`(n=1, 1, 0)+p)^2, add(b(n-i*j, i-1,

      `if`(j=1, 1, 0)+p), j=0..n/i))

    end:

a:= n-> b(n$2, 0):

seq(a(n), n=0..60);  # Alois P. Heinz, Apr 05 2018

MATHEMATICA

Array[Total@ Map[Count[Split@ #, _?(Length@ # == 1 &)]^2 &, IntegerPartitions[#]] &, 43] (* Michael De Vlieger, Apr 05 2018 *)

PROG

(Python)

def frequencies(partition, n):

    tot = 0

    freq_list = []

    i = 0

    for p in partition:

        freq = [0 for i in range(n+1)]

        for i in p:

            freq[i] += 1

        for f in freq:

            if f == 0:

                tot += 1

        freq_list.append(freq)

    return freq_list

def sum_square_freqs_of_one(freq_part):

    tot = 0

    for f in freq_part:

        count = 0

        for i in f:

            if i == 1:

                count += 1

        tot += count*count

    return tot

#Pass in whichever value here for i, or iterate over the block of code

  part = partitions(n)

freq_part = frequencies(part, n)

sum_of_ones = sum_square_freqs_of_one(freq_part)

CROSSREFS

Cf. A024786, A197126.

Sequence in context: A276407 A022310 A126593 * A173074 A099473 A051572

Adjacent sequences:  A302297 A302298 A302299 * A302301 A302302 A302303

KEYWORD

nonn

AUTHOR

Emily Anible, Apr 04 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 17:42 EST 2019. Contains 329768 sequences. (Running on oeis4.)