cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A347707 Number of distinct possible integer reverse-alternating products of integer partitions of n.

This page as a plain text file.
%I A347707 #6 Oct 27 2021 22:24:08
%S A347707 1,1,2,2,3,3,4,5,5,6,6,8,8,9,9,11,11,13,12,14,14,15,15,18,17,19,18,20,
%T A347707 20,22,21,25,23,26,25,28,26,29,27,31,29,32,31,34,33,35,34,38,35,41,37,
%U A347707 42,40,43,41,45,42,46,44,48,45,50,46,52,49,53
%N A347707 Number of distinct possible integer reverse-alternating products of integer partitions of n.
%C A347707 We define the alternating product of a sequence (y_1,...,y_k) to be Product_i y_i^((-1)^(i-1)). The reverse-alternating product is the alternating product of the reversed sequence.
%e A347707 Representative partitions for each of the a(16) = 11 alternating products:
%e A347707          (16) -> 16
%e A347707      (14,1,1) -> 14
%e A347707      (12,2,2) -> 12
%e A347707      (10,3,3) -> 10
%e A347707       (8,4,4) -> 8
%e A347707   (9,3,2,1,1) -> 6
%e A347707      (10,4,2) -> 5
%e A347707      (12,3,1) -> 4
%e A347707   (6,4,2,2,2) -> 3
%e A347707      (10,5,1) -> 2
%e A347707         (8,8) -> 1
%t A347707 revaltprod[q_]:=Product[Reverse[q][[i]]^(-1)^(i-1),{i,Length[q]}];
%t A347707 Table[Length[Select[Union[revaltprod/@IntegerPartitions[n]],IntegerQ]],{n,0,30}]
%Y A347707 The even-length version is A000035.
%Y A347707 The non-reverse version is A028310.
%Y A347707 The version for factorizations has special cases:
%Y A347707 - no changes: A046951
%Y A347707 - non-reverse: A046951
%Y A347707 - non-integer: A038548
%Y A347707 - odd-length: A046951 + A010052
%Y A347707 - non-reverse non-integer: A347460
%Y A347707 - non-integer odd-length: A347708
%Y A347707 - non-reverse odd-length: A046951 + A010052
%Y A347707 - non-reverse non-integer odd-length: A347708
%Y A347707 The odd-length version is a(n) - A059841(n).
%Y A347707 These partitions are counted by A347445, non-reverse A347446.
%Y A347707 Counting non-integers gives A347462, non-reverse A347461.
%Y A347707 A000041 counts partitions.
%Y A347707 A027187 counts partitions of even length.
%Y A347707 A027193 counts partitions of odd length.
%Y A347707 A103919 counts partitions by sum and alternating sum, reverse A344612.
%Y A347707 A119620 counts partitions with alternating product 1, ranked by A028982.
%Y A347707 A276024 counts distinct positive subset-sums of partitions, strict A284640.
%Y A347707 A304792 counts distinct subset-sums of partitions.
%Y A347707 A325534 counts separable partitions, complement A325535.
%Y A347707 A345926 counts possible alternating sums of permutations of prime indices.
%Y A347707 Cf. A000070, A002033, A002219, A108917, A122768, A325765, A344654, A344740, A347443, A347444, A347448, A347449.
%K A347707 nonn
%O A347707 0,3
%A A347707 _Gus Wiseman_, Oct 13 2021