A243052 -id:A243052 - cp's OEIS frontend

A243503 Sums of parts of partitions (i.e., their sizes) as ordered in the table A241918: a(n) = Sum_{i=A203623(n-1)+2..A203623(n)+1} A241918(i).

0, 1, 2, 2, 3, 4, 4, 3, 3, 6, 5, 6, 6, 8, 5, 4, 7, 5, 8, 9, 7, 10, 9, 8, 4, 12, 4, 12, 10, 8, 11, 5, 9, 14, 6, 7, 12, 16, 11, 12, 13, 11, 14, 15, 7, 18, 15, 10, 5, 7, 13, 18, 16, 6, 8, 16, 15, 20, 17, 11, 18, 22, 10, 6, 10, 14, 19, 21, 17, 10, 20, 9, 21, 24, 6, 24

Offset: 1

Antti Karttunen, Jun 05 2014

nonn

Each n occurs A000041(n) times in total.

Where are the first and the last occurrence of each n located?

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

Cf. A243504 (the products of parts), A241918, A000041, A227183, A075158, A056239, A241909.
Sum of prime indices of A241916, the even bisection of A358195.
Sums of even-indexed rows of A358172.
A112798 lists prime indices, length A001222, sum A056239, max A061395.
Cf. A005940, A019565, A246277, A326844, A356958, A359362.

Table[If[n==1,0,With[{y=Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]},Last[y]*Length[y]+Last[y]-Total[y]+Length[y]-1]],{n,100}] (* Gus Wiseman, Jan 09 2023 *)

a(n) = Sum_{i=A203623(n-1)+2..A203623(n)+1} A241918(i).
a(n) = A056239(A241909(n)).
a(n) = A227183(A075158(n-1)).
a(A000040(n)) = a(A000079(n)) = n for all n >= 1.
a(A122111(n)) = a(n) for all n.
a(A243051(n)) = a(n) for all n, and likewise for A243052, A243053 and other rows of A243060.
a(n) = A061395(n) * A001222(n) + A061395(n) - A056239(n) + A001222(n) - 1. - Gus Wiseman, Jan 09 2023
a(n) = A326844(2n) + A001222(n). - Gus Wiseman, Jan 09 2023

A243051 Integer sequence induced by Bulgarian solitaire operation on partition list A241918: a(n) = A241909(A242424(A241909(n))).

Original entry on oeis.org

1, 2, 4, 3, 8, 25, 16, 9, 9, 343, 32, 10, 64, 14641, 125, 27, 128, 15, 256, 98, 2401, 371293, 512, 30, 27, 24137569, 6, 2662, 1024, 147, 2048, 81, 161051, 893871739, 625, 50, 4096, 78310985281, 4826809, 28, 8192, 3993, 16384, 57122, 50, 14507145975869, 32768, 90, 81

Offset: 1

Antti Karttunen, May 29 2014

nonn

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, which is added to the remaining set of piles. Essentially, this operation is a function whose domain and range are unordered integer partitions (cf. A000041) and which preserves the total size of a partition (the sum of its parts). This sequence is induced when the operation is implemented on the partitions as ordered by the list A241918.

			For n = 10, we see that as 10 = 2*5 = p_1^1 * p_2^0 * p_3^1, it encodes a partition [2,2,2]. Applying one step of Bulgarian solitaire (subtract one from each part, and add a new part as large as there were parts in the old partition) to this partition results a new partition [1,1,1,3], which is encoded in the prime factorization of p_1^0 * p_2^0 * p_3^0 * p_4^3 = 7^3 = 343. Thus a(10) = 343.
For n = 46, we see that as 46 = 2*23 = p_1 * p_9 = p_1^1 * p_2^0 * p_3^0 * ... * p_9^1, it encodes a partition [2,2,2,2,2,2,2,2,2]. Applying one step of Bulgarian solitaire to this partition results a new partition [1,1,1,1,1,1,1,1,1,9], which is encoded in the prime factorization of p_1^0 * p_2^0 * ... * p_9^0 * p_10^9 = 29^9 = 14507145975869. Thus a(46) = 14507145975869.
For n = 1875, we see that as 1875 = p_1^0 * p_2^1 * p_3^4, it encodes a partition [1,2,5]. Applying Bulgarian Solitaire, we get a new partition [1,3,4]. This in turn is encoded by p_1^0 * p_2^2 * p_3^2 = 3^2 * 5^2 = 225. Thus a(1875)=225.

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 = 1..256
Ethan Akin and Morton Davis, "Bulgarian solitaire", American Mathematical Monthly 92 (4): 237-250. (1985).
Wikipedia, Bulgarian solitaire

Row 1 of A243060 (table which gives successive "recursive iterates" of this sequence and converges towards A122111).
Fixed points: A243054.
Cf. A243052, A243053, A243503, A242424, A241909, A226062, A075157, A075158.

a(n) = A241909(A242424(A241909(n))).
a(n) = 1 + A075157(A226062(A075158(n-1))).
A243503(a(n)) = A243503(n) for all n. [Because Bulgarian operation doesn't change the total sum of the partition].

A243060 Square array read by antidiagonals: rows are successively recursivized versions of Bulgarian solitaire operation (starting from the usual "first order" version, A243051), as applied to partitions listed in A241918.

Original entry on oeis.org

1, 2, 1, 4, 2, 1, 3, 4, 2, 1, 8, 3, 4, 2, 1, 25, 8, 3, 4, 2, 1, 16, 6, 8, 3, 4, 2, 1, 9, 16, 6, 8, 3, 4, 2, 1, 9, 5, 16, 6, 8, 3, 4, 2, 1, 343, 9, 5, 16, 6, 8, 3, 4, 2, 1, 32, 12, 9, 5, 16, 6, 8, 3, 4, 2, 1, 10, 32, 12, 9, 5, 16, 6, 8, 3, 4, 2, 1, 64, 35, 32, 12, 9, 5, 16, 6, 8, 3, 4, 2, 1, 14641, 64, 10, 32, 12, 9, 5, 16, 6, 8, 3, 4, 2, 1, 125, 24, 64, 10, 32, 12, 9, 5, 16, 6, 8, 3, 4, 2, 1

Offset: 1

Antti Karttunen, May 29 2014

The array is read by antidiagonals: A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), ... .
Each row is a A241909-conjugate of the corresponding row in A243070.
Rows in both arrays converge towards A122111.
First point where row k differs from row k of A243070 seems to be A000040(k+2): primes from five onward: 5, 7, 11, 13, 17, 19, 23, 29, 31, ...
While the first point where row k differs from A122111 seems to begin as 6, 12, 24, 48, 96, 192, 384, 768, 1536, 3072, ... A007283 (3*2^n) from the term n=1 onward.
The rows in this table preserve A243503.

			The top left corner of the array:
  1, 2, 4, 3, 8, 25, 16, 9, 9, 343,  32,  10,  64, 14641,   125,   27, ...
  1, 2, 4, 3, 8,  6, 16, 5, 9,  12,  32,  35,  64,    24,    18,   25, ...
  1, 2, 4, 3, 8,  6, 16, 5, 9,  12,  32,  10,  64,    24,    18,    7, ...
  1, 2, 4, 3, 8,  6, 16, 5, 9,  12,  32,  10,  64,    24,    18,    7, ...
  1, 2, 4, 3, 8,  6, 16, 5, 9,  12,  32,  10,  64,    24,    18,    7, ...

Row 1: A243051, Row 2: A243052, Row 3: A243053.
Rows converge towards A122111.
Cf. A243070, A243503.

(define (A243060 n) (A243060bi (A002260 n) (A004736 n)))
(define (A243060bi row col) (explist->n (ascpart_to_prime-exps (bulgarian-operation-n-th-order (prime-exps_to_ascpart (primefacs->explist col)) row))))
(define (bulgarian-operation-n-th-order ascpart n) (if (or (zero? n) (null? ascpart)) ascpart (let ((newpart (length ascpart))) (let loop ((newpartition (list)) (ascpart ascpart)) (cond ((null? ascpart) (sort (cons newpart (bulgarian-operation-n-th-order newpartition (- n 1))) <)) (else (loop (if (= 1 (car ascpart)) newpartition (cons (- (car ascpart) 1) newpartition)) (cdr ascpart))))))))
;; For other required functions and libraries, please see A243051.

A243072 Second order Bulgarian solitaire operation on partition list A112798: a(1) = 1, a(n) = A000040(A001222(n)) * A242424(A064989(n)).

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 12, 5, 9, 12, 20, 10, 28, 18, 18, 7, 44, 15, 52, 20, 27, 30, 68, 14, 36, 42, 25, 30, 76, 30, 92, 11, 45, 66, 54, 21, 116, 78, 63, 28, 124, 45, 148, 50, 50, 102, 164, 22, 81, 60, 99, 70, 172, 35, 90, 42, 117, 114, 188, 42, 212, 138, 75, 13, 126

Offset: 1

Antti Karttunen, May 29 2014

nonn

The usual Bulgarian Solitaire operation (the "first order" version, cf. A242424) applied to an unordered integer partition means: subtract one from each part, and add a new part as large as there were parts in the old partition.
The "Second Order Bulgarian Solitaire" operation means that after subtracting one from each part of the old partition (and discarding the parts that diminished to zero), we apply the (first order) Bulgarian operation to the remaining partition before adding a new part as large as there were parts in the original partition.
In this context, where the parts of partitions are encoded with the indices of primes in the prime factorization of n (as in A112798), A064989(n) gives the remaining partition after one has been subtracted from each part; A242424 applies the first order Bulgarian operation to it; and multiplying with A000040(A001222(n)) adds a part as large as there originally were parts.

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

Row 2 of A243070. Differs from A122111 for the first time at n=7.

Cf. A242424, A243073, A112798, A105560, A000040, A001222, A064989, A243052, A241909.

a(1) = 1, a(n) = A000040(A001222(n)) * A242424(A064989(n)) = A105560(n) * A242424(A064989(n)).

a(n) = A241909(A243052(A241909(n))).

A243053 Integer sequence induced by third-order Bulgarian solitaire operation on partition list A241918: a(n) = A241909(A243073(A241909(n))).

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 16, 5, 9, 12, 32, 10, 64, 24, 18, 7, 128, 15, 256, 20, 36, 48, 512, 55, 27, 96, 25, 40, 1024, 30, 2048, 49, 72, 192, 54, 21, 4096, 384, 144, 637, 8192, 60, 16384, 80, 50, 768, 32768, 22, 81, 45, 288, 160, 65536, 35, 108, 22627, 576, 1536, 131072

Offset: 1

Antti Karttunen, May 29 2014

nonn

The usual (first-order) Bulgarian Solitaire operation (cf. A243051) applied to an unordered integer partition means: subtract one from each part, and add a new part as large as there were parts in the old partition.
The "Second-Order Bulgarian Operation" means that after subtracting one from each part of the old partition (and discarding the parts that diminished to zero), we apply the (first-order) Bulgarian operation to the remaining partition before adding a new part as large as there were parts in the original partition.
Similarly, in "Third-Order Bulgarian Solitaire Operation", we apply the Second-Order Bulgarian operation to the remaining partition (after we have subtracted one from each part) before adding a new part as large as there were parts in the original partition.
How the partitions are encoded in this case, see A241918.

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

Third row of A243060.
Differs from A122111 for the first time at n=24, where a(24) = 55, while A122111(24) = 14.
Cf. A243051, A243052, A241918, A241909, A243073.

(define (A243053 n) (explist->n (ascpart_to_prime-exps (bulgarian-operation-n-th-order (prime-exps_to_ascpart (primefacs->explist n)) 3))))
(define (bulgarian-operation-n-th-order ascpart n) (if (or (zero? n) (null? ascpart)) ascpart (let ((newpart (length ascpart))) (let loop ((newpartition (list)) (ascpart ascpart)) (cond ((null? ascpart) (sort (cons newpart (bulgarian-operation-n-th-order newpartition (- n 1))) <)) (else (loop (if (= 1 (car ascpart)) newpartition (cons (- (car ascpart) 1) newpartition)) (cdr ascpart))))))))
;; Other required functions and libraries, please see A243051.

a(n) = A241909(A243073(A241909(n))).

cp's OEIS Frontend

A243503 Sums of parts of partitions (i.e., their sizes) as ordered in the table A241918: a(n) = Sum_{i=A203623(n-1)+2..A203623(n)+1} A241918(i).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A243051 Integer sequence induced by Bulgarian solitaire operation on partition list A241918: a(n) = A241909(A242424(A241909(n))).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

A243060 Square array read by antidiagonals: rows are successively recursivized versions of Bulgarian solitaire operation (starting from the usual "first order" version, A243051), as applied to partitions listed in A241918.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Scheme

A243072 Second order Bulgarian solitaire operation on partition list A112798: a(1) = 1, a(n) = A000040(A001222(n)) * A242424(A064989(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A243053 Integer sequence induced by third-order Bulgarian solitaire operation on partition list A241918: a(n) = A241909(A243073(A241909(n))).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula