A227753 -id:A227753 - cp's OEIS frontend

A225794 Sizes of Garden of Eden partitions in Bulgarian Solitaire, given in the same order as the runlength codes of the corresponding partitions (A227753).

3, 4, 6, 8, 5, 7, 5, 7, 9, 6, 10, 8, 6, 9, 11, 8, 12, 10, 13, 10, 14, 12, 7, 11, 15, 12, 9, 13, 11, 8, 10, 7, 11, 9, 7, 10, 12, 14, 9, 13, 11, 14, 16, 11, 15, 18, 13, 8, 14, 17, 12, 16, 13, 15, 10, 14, 12, 9, 11, 13, 8, 12, 10, 8, 12, 14, 16, 11, 15, 13, 16, 18

Offset: 1

Antti Karttunen, Jul 27 2013

nonn

Each n occurs A123975(n) times in total.

Antti Karttunen, Table of n, a(n) for n = 1..86

Cf. A227753, A123975, A226062.

(define (A225794 n) (A227183 (A227753 n)))

a(n) = A227183(A227753(n)).

A226062 a(n) = Bulgarian solitaire operation applied to the partition encoded in the runlengths of binary expansion of n.

Original entry on oeis.org

0, 1, 3, 2, 13, 7, 6, 6, 11, 29, 15, 58, 9, 14, 4, 14, 19, 27, 61, 54, 245, 31, 122, 52, 27, 25, 30, 50, 25, 12, 12, 30, 35, 23, 59, 46, 237, 125, 118, 44, 235, 501, 63, 1002, 233, 250, 116, 40, 51, 19, 57, 38, 229, 62, 114, 36, 59, 17, 28, 34, 57, 8, 28, 62

Offset: 0

Antti Karttunen, Jul 06 2013

For this sequence the partitions are encoded in the binary expansion of n in the same way as in A129594.
In "Bulgarian solitaire" a deck of cards or another finite set of objects is divided into one or more piles, and the "Bulgarian operation" is performed by taking one card from each pile, and making a new pile of them. The question originally posed was: on what condition the resulting partitions will eventually reach a fixed point, that is, a collection of piles that will be unchanged by the operation. See Martin Gardner reference and the Wikipedia-page.
A037481 gives the fixed points of this sequence, which are numbers that encode triangular partitions: 1 + 2 + 3 + ... + n.
A227752(n) tells how many times n occurs in this sequence, and A227753 gives the terms that do not occur here.
Of further interest: among each A000041(n) numbers j_i: j1, j2, ..., jk for which A227183(j_i)=n, how many cycles occur and what is the size of the largest one? (Both are 1 when n is in A000217, as then the fixed points are the only cycles.) Cf. A185700, A188160.
Also, A123975 answers how many Garden of Eden partitions there are for the deck of size n in Bulgarian Solitaire, corresponding to values that do not occur as the terms of this sequence.

			5 has binary expansion "101", whose runlengths are [1,1,1], which are converted to nonordered partition {1+1+1}.
6 has binary expansion "110", whose runlengths are [1,2] (we scan the runs of bits from right to left), which are converted to nonordered partition {1+2}.
7 has binary expansion "111", whose list of runlengths is [3], which is converted to partition {3}.
In "Bulgarian Operation" we subtract one from each part (with 1-parts vanishing), and then add a new part of the same size as there originally were parts, so that the total sum stays same.
Thus starting from a partition encoded by 5, {1,1,1} the operation works as 1-1, 1-1, 1-1 (all three 1's vanish) but appends part 3 as there originally were three parts, thus we get a new partition {3}. Thus a(5)=7.
From the partition {3} -> 3-1 and 1, which gives a new partition {1,2}, so a(7)=6.
For partition {1+2} -> 1-1 and 2-1, thus the first part vanishes, and the second is now 1, to which we add the new part 2, as there were two parts originally, thus {1+2} stays as {1+2}, and we have reached a fixed point, a(6)=6.

Martin Gardner, Colossal Book of Mathematics, Chapter 34, Bulgarian Solitaire and Other Seemingly Endless Tasks, pp. 455-467, W. W. Norton & Company, 2001.

Antti Karttunen, Table of n, a(n) for n = 0..8191
Ethan Akin and Morton Davis, "Bulgarian solitaire", American Mathematical Monthly 92 (4): 237-250. (1985).
Antti Karttunen, Python-program for computing this and related sequences.
Wikipedia, Bulgarian solitaire

Cf. A227147, A227183, A227452.
Cf. A037481 (gives the fixed points).
Cf. A227752 (how many times n occurs here).
Cf. A227753 (numbers that do not occur here).
Cf. A129594 (conjugates the partitions encoded with the same system).
Cf. also A123975, A074909, A185700, A071762, A075157, A075158, A243353, A243354, A242424, A243051.

Other identities:
A227183(a(n)) = A227183(n). [This operation doesn't change the total sum of the partition.]
a(n) = A243354(A242424(A243353(n))).
a(n) = A075158(A243051(1+A075157(n))-1).

A123975 Number of Garden of Eden partitions of n in Bulgarian Solitaire.

Original entry on oeis.org

0, 0, 1, 1, 2, 3, 5, 7, 10, 14, 20, 27, 37, 49, 66, 86, 113, 147, 190, 243, 311, 394, 499, 627, 786, 980, 1220, 1510, 1865, 2294, 2816, 3443, 4202, 5110, 6203, 7507, 9067, 10923, 13135, 15755, 18865, 22540, 26885, 32001, 38032, 45112, 53430, 63171

Offset: 1

Vladeta Jovovic, Nov 23 2006

a(n) gives the number of times n occurs in A225794. - Antti Karttunen, Jul 27 2013

Seiichi Manyama, Table of n, a(n) for n = 1..10000
Brian Hopkins, Michael A. Jones, Shift-Induced Dynamical Systems on Partitions and Compositions, Electron. J. Combin. 13 (2006), Research Paper 80.
Brian Hopkins and James A. Sellers, Exact enumeration of Garden of Eden partitions, INTEGERS: Electronic Journal of Combinatorial Number Theory 7(2) (2007), #A19.

Cf. A000041, A045943, A064173, A101198, A237831.

Cf. A227753, A225794, A226062.

p:=product(1/(1-q^i), i=1..200)*sum((-1)^(r-1)*q^((3*r^2+3*r)/2), r=1..200):s:=series(p, q, 200): for j from 0 to 199 do printf(`%d,`,coeff(s, q, j)) od: # James Sellers, Nov 30 2006

my(N=50, x='x+O('x^N)); concat([0, 0], Vec(1/prod(k=1, N, 1-x^k)*sum(k=1, N, (-1)^(k-1)*x^(3*k*(k+1)/2)))) \\ Seiichi Manyama, May 21 2023

a(n) = A064173(n) - A101198(n).
a(n) = Sum_{j>=1} (-1)^(j+1)*p(n-b(j)) where b(j) = 3*j*(j+1)/2 (A045943) and p(n) is the number of partitions of n (see A000041). See Hopkins & Sellers. - Michel Marcus, Sep 26 2018
a(n) ~ exp(Pi*sqrt(2*n/3)) / (8*n*sqrt(3)) * (1 - (1/(2*Pi) + 19*Pi/144) / sqrt(n/6)). - Vaclav Kotesovec, May 26 2023

More terms from James Sellers, Nov 30 2006

A227752 a(n) is the number of occurrences of n in A226062.

Original entry on oeis.org

1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 0, 1, 2, 1, 2, 1, 1, 1, 0, 2, 0, 0, 0, 1, 2, 2, 0, 2, 2, 1, 2, 1, 1, 1, 1, 2, 1, 0, 1, 2, 1, 0, 0, 0, 1, 0, 1, 1, 2, 2, 1, 3, 1, 0, 1, 2, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 2, 1, 0, 1, 2, 2, 0, 0, 0, 2, 0, 2, 2, 1, 0, 0, 0, 0, 0, 0

Offset: 0

Antti Karttunen, Jul 26 2013

nonn

Antti Karttunen, Table of n, a(n) for n = 0..319

A227753 gives the positions of zeros.

In the following formula [] stands for Iverson brackets. Essentially we are just naively counting the integers which A226062 maps to n. A000225 is the guaranteed upper limit for the runlength codes for the partitions of size n:
a(n) = Sum_{i=0..A000225(A227183(n))} [A226062(i)==n].
a(n) = Sum_{i=A227368(A227183(n))..A000225(A227183(n))} [A226062(i)==n]. [This is slightly faster if somebody invents a clever formula for the lower limit A227368.]

cp's OEIS Frontend

A225794 Sizes of Garden of Eden partitions in Bulgarian Solitaire, given in the same order as the runlength codes of the corresponding partitions (A227753).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A226062 a(n) = Bulgarian solitaire operation applied to the partition encoded in the runlengths of binary expansion of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

A123975 Number of Garden of Eden partitions of n in Bulgarian Solitaire.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

PARI

Formula

Extensions

A227752 a(n) is the number of occurrences of n in A226062.

Views

Author

Keywords

Links

Crossrefs

Formula