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.

A240674 Number of partitions p of n that are disjoint from their conjugate.

This page as a plain text file.
%I A240674 #13 Jul 19 2024 09:55:48
%S A240674 1,0,2,2,2,2,4,4,8,10,10,14,18,18,26,30,36,44,60,64,82,96,114,130,164,
%T A240674 176,222,248,296,338,406,450,550,620,726,816,968,1074,1270,1418,1648,
%U A240674 1836,2150,2382,2758,3080,3534,3942,4538,5034,5778,6416,7312,8136,9258
%N A240674 Number of partitions p of n that are disjoint from their conjugate.
%C A240674 First column of the array at A240181.
%F A240674 a(n) = 2*A114701(n), for n >= 1.
%e A240674 a(6) counts these 4 partitions:  6, 33, 222, 111111, of which the respective conjugates are 111111, 222, 33, 6.
%t A240674 z = 30; p[n_, k_] := p[n, k] = IntegerPartitions[n][[k]]; c[p_] := c[p] = Table[Count[#, _?(# >= i &)], {i, First[#]}] &[p]; b[n_] := b[n] = Table[Intersection[p[n, k], c[p[n, k]]], {k, 1, PartitionsP[n]}]; Table[Count[Map[Length, b[n]], 0], {n, 1, z}] (* this sequence *)
%t A240674 Table[Count[Map[Length, b[n]], 1], {n, 1, z}]   (* A240675 *)
%Y A240674 Cf. A240675, A114701, A240181.
%K A240674 nonn,easy
%O A240674 0,3
%A A240674 _Clark Kimberling_, Apr 12 2014
%E A240674 Name corrected by _Clark Kimberling_, Sep 28 2023
%E A240674 a(0)=1 prepended by _Alois P. Heinz_, Jul 19 2024