This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122111 Self-inverse permutation of the positive integers induced by partition enumeration in A112798 and partition conjugation. 115
 1, 2, 4, 3, 8, 6, 16, 5, 9, 12, 32, 10, 64, 24, 18, 7, 128, 15, 256, 20, 36, 48, 512, 14, 27, 96, 25, 40, 1024, 30, 2048, 11, 72, 192, 54, 21, 4096, 384, 144, 28, 8192, 60, 16384, 80, 50, 768, 32768, 22, 81, 45, 288, 160, 65536, 35, 108, 56, 576, 1536, 131072, 42 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Factor n; replace each Prime(i) with i, take the conjugate partition, replace parts i with Prime(i) and multiply out. From Antti Karttunen, May 12-19 2014: (Start) For all n >= 1, A001222(a(n)) = A061395(n), and vice versa, A061395(a(n)) = A001222(n). Because the partition conjugation doesn't change partition's total sum, this permutation preserves A056239, i.e., A056239(a(n)) = A056239(n) for all n. Because this permutation commutes with A241909, in other words, as a(A241909(n)) = A241909(a(n)) for all n, from which follows, because both permutations are self-inverse, that a(n) = A241909(a(A241909(n))), it means that this is also induced when partitions are conjugated in the partition enumeration system A241918. (Not only in A112798.) (End) From Antti Karttunen, Jul 31 2014: (Start) Rows in arrays A243060 and A243070 converge towards this sequence, and also, assuming no surprises at the rate of that convergence, this sequence occurs also as the central diagonal of both. Each even number is mapped to an unique term of A102750 and vice versa. Conversely, each odd number (larger than 1) is mapped to an unique term of A070003, and vice versa. The permutation pair A243287-A243288 has the same property. This is also used to induce the permutations A244981-A244984. Taking the odd bisection and dividing the largest prime factor out results the permutation A243505. Shares with A245613 the property that each term of A028260 is mapped to a unique term of A244990 and each term of A026424 is mapped to a unique term of A244991. Conversely, with A245614 (the inverse of above), shares the property that each term of A244990 is mapped to a unique term of A028260 and each term of A244991 is mapped to a unique term of A026424. (End) The Maple program follows the steps described in the first comment. The subprogram C yields the conjugate partition of a given partition. - Emeric Deutsch, May 09 2015 The Heinz number of the partition that is conjugate to the partition with Heinz number n. The Heinz number of a partition p = [p_1, p_2, ..., p_r] is defined as Product(p_j-th prime, j=1...r). Example: a(3) = 4. Indeed, the partition with Heinz number 3 is ; its conjugate is [1,1] having Heinz number 4. - Emeric Deutsch, May 19 2015 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 1024 terms from Antti Karttunen) A. Karttunen, A few notes on A122111, A241909 & A241916. FORMULA From Antti Karttunen, May 12-19 2014: (Start) a(1) = 1, a(p_i) = 2^i, and for other cases, if n = p_i1 * p_i2 * p_i3 * ... * p_{k-1} * p_k, where p's are primes, not necessarily distinct, sorted into nondescending order so that i1 <= i2 <= i3 <= ... <= i_{k-1} <= ik, then a(n) = 2^(ik-i_{k-1}) * 3^(i_{k-1}-i_{k-2}) * ... * p_{i_{k-1}}^(i2-i1) * p_ik^(i1). This can be implemented as a recurrence, with base case a(1) = 1, and then using any of the following three alternative formulas:   a(n) = A105560(n) * a(A064989(n)) = A000040(A001222(n)) * a(A064989(n)). [Cf. the formula for A242424.]   a(n) = A000079(A241917(n)) * A003961(a(A052126(n))).   a(n) = (A000040(A071178(n))^A241919(n)) * A242378(A071178(n), a(A051119(n))). [Here ^ stands for the ordinary exponentiation, and the bivariate function A242378(k,n) changes each prime p(i) in the prime factorization of n to p(i+k), i.e., it's the result of A003961 iterated k times starting from n.] a(n) = 1 + A075157(A129594(A075158(n-1))). [Follows from the commutativity with A241909, please see the comments section.] (End) From Antti Karttunen, Jul 31 2014: (Start) As a composition of related permutations: a(n) = A153212(A242419(n)) = A242419(A153212(n)). a(n) = A241909(A241916(n)) = A241916(A241909(n)). a(n) = A243505(A048673(n)). a(n) = A064216(A243506(n)). Other identities. For all n >= 1, the following holds: A006530(a(n)) = A105560(n). [The latter sequence gives greatest prime factor of the n-th term]. a(2n)/a(n) = A105560(2n)/A105560(n), which is equal to A003961(A105560(n))/A105560(n) when n > 1. A243505(n) = A052126(a(2n-1)) = A052126(a(4n-2)). A066829(n) = A244992(a(n)) and vice versa, A244992(n) = A066829(a(n)). A243503(a(n)) = A243503(n). [Because partition conjugation does not change the partition size.] A238690(a(n)) = A238690(n). - per Matthew Vandermast's note in that sequence. A238745(n) = a(A181819(n)) and a(A238745(n)) = A181819(n). - per Matthew Vandermast's note in A238745. A181815(n) = a(A181820(n)) and a(A181815(n)) = A181820(n). - per Matthew Vandermast's note in A181815. (End) MAPLE with(numtheory): c := proc (n) local B, C: B := proc (n) local pf: pf := op(2, ifactors(n)): [seq(seq(pi(op(1, op(i, pf))), j = 1 .. op(2, op(i, pf))), i = 1 .. nops(pf))] end proc: C := proc (P) local a: a := proc (j) local c, i: c := 0; for i to nops(P) do if j <= P[i] then c := c+1 else  end if end do: c end proc: [seq(a(k), k = 1 .. max(P))] end proc: mul(ithprime(C(B(n))[q]), q = 1 .. nops(C(B(n)))) end proc: seq(c(n), n = 1 .. 59); # Emeric Deutsch, May 09 2015 # second Maple program: a:= n-> (l-> mul(ithprime(add(`if`(j

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.

Last modified October 17 08:10 EDT 2019. Contains 328106 sequences. (Running on oeis4.)