A022811 -id:A022811 - cp's OEIS frontend

A022816 Number of terms in 6th derivative of a function composed with itself n times.

1, 11, 44, 121, 271, 532, 952, 1590, 2517, 3817, 5588, 7943, 11011, 14938, 19888, 26044, 33609, 42807, 53884, 67109, 82775, 101200, 122728, 147730, 176605, 209781, 247716, 290899, 339851, 395126, 457312, 527032, 604945, 691747

Offset: 1

N. J. A. Sloane

W. C. Yang (yang(AT)math.wisc.edu), Derivatives of self-compositions of functions, preprint, 1997.

Vincenzo Librandi, Table of n, a(n) for n = 1..10000
W. C. Yang, Derivatives are essentially integer partitions, Discrete Mathematics, 222(1-3), July 2000, 235-245.
Index entries for linear recurrences with constant coefficients, signature (6, -15, 20, -15, 6, -1).

Cf. A008778, A022811-A022818, A024207-A024210.

[n*(n+1)*(n^3+24*n^2+81*n-46)/120: n in [1..40]]; // Vincenzo Librandi, Oct 10 2011

Table[n(n+1)(n^3+24n^2+81n-46)/120,{n,40}] (* or *) LinearRecurrence[{6,-15,20,-15,6,-1},{1,11,44,121,271,532},40] (* Harvey P. Dale, Dec 29 2017 *)

a(n)=n*(n+1)*(n^3+24*n^2+81*n-46)/120 \\ Charles R Greathouse IV, Oct 21 2022

a(n) = n*(n+1)*(n^3+24*n^2+81*n-46)/120. G.f.: x*(1+5*x-7*x^2+2*x^3)/(x-1)^6. - R. J. Mathar, Sep 15 2009

More terms from Christian G. Bower, Aug 15 1999.

A355389 Number of unordered pairs of distinct integer partitions of n.

Original entry on oeis.org

0, 0, 1, 3, 10, 21, 55, 105, 231, 435, 861, 1540, 2926, 5050, 9045, 15400, 26565, 43956, 73920, 119805, 196251, 313236, 501501, 786885, 1239525, 1915903, 2965830, 4528545, 6909903, 10417330, 15699606, 23403061, 34848726, 51435153, 75761895, 110744403, 161577276

Offset: 0

Gus Wiseman, Jul 04 2022

nonn

			The a(0) = 0 through a(4) = 10 pairs:
  .  .  (2)(11)  (3)(21)    (4)(22)
                 (3)(111)   (4)(31)
                 (21)(111)  (22)(31)
                            (4)(211)
                            (22)(211)
                            (31)(211)
                            (4)(1111)
                            (22)(1111)
                            (31)(1111)
                            (211)(1111)

The version for compositions is A006516.
Without distinctness we get A086737.
The unordered version is A355390, without distinctness A001255.
A000041 counts partitions, strict A000009.
A001970 counts multiset partitions of partitions.
A063834 counts partitions of each part of a partition.
Cf. A022811, A070933, A316245, A317715, A319794, A319910, A323433, A339006, A355385.

a:= n-> binomial(combinat[numbpart](n),2):
seq(a(n), n=0..36);  # Alois P. Heinz, Feb 07 2024

Table[Binomial[PartitionsP[n],2],{n,0,6}]

a(n) = binomial(numbpart(n), 2); \\ Michel Marcus, Jul 05 2022

a(n) = binomial(A000041(n), 2) = A355390(n)/2.

A355386 Position of first appearance of n in A355382, where A355382(m) = number of divisors d of m such that bigomega(d) = omega(m); or a(n) = -1 if n does not appear in A355382.

Original entry on oeis.org

1, 12, 36, 120, 180, 360, 840, 1260, 5400, 27000, 2520, 5040, 6300, 7560, 15120, 12600, 25200

Offset: 1

Gus Wiseman, Jul 02 2022

The first position of -1 appears to be 18, pointed out by Amiram Eldar.
The terms are not always increasing.
The statistic omega = A001221 counts distinct prime factors (without multiplicity).
The statistic bigomega = A001222 counts prime factors with multiplicity.

			The terms together with their prime indices begin:
      1: {}
     12: {1,1,2}
     36: {1,1,2,2}
    120: {1,1,1,2,3}
    180: {1,1,2,2,3}
    360: {1,1,1,2,2,3}
    840: {1,1,1,2,3,4}
   1260: {1,1,2,2,3,4}
   5400: {1,1,1,2,2,2,3,3}
  27000: {1,1,1,2,2,2,3,3,3}
   2520: {1,1,1,2,2,3,4}
   5040: {1,1,1,1,2,2,3,4}
   6300: {1,1,2,2,3,3,4}
   7560: {1,1,1,2,2,2,3,4}
  15120: {1,1,1,1,2,2,2,3,4}
The terms together with their divisors satisfying the condition begin:
      1:   1
     12:   4,   6
     36:   4,   6,   9
    120:   8,  12,  20,  30
    180:  12,  18,  20,  30,  45
    360:   8,  12,  18,  20,  30,  45
    840:  24,  40,  56,  60,  84, 140, 210
   1260:  36,  60,  84,  90, 126, 140, 210, 315
   5400:   8,  12,  18,  20,  27,  30,  45,  50,  75
  27000:   8,  12,  18,  20,  27,  30,  45,  50,  75, 125
   2520:  24,  36,  40,  56,  60,  84,  90, 126, 140, 210, 315
   5040:  16,  24,  36,  40,  56,  60,  84,  90, 126, 140, 210, 315
   6300:  36,  60,  84,  90, 100, 126, 140, 150, 210, 225, 315, 350, 525

These are the positions of first appearances in A355382, which is the version of A181591 without multiplicity.
A000005 counts divisors.
A001221 counts prime indices without multiplicity.
A001222 counts prime indices with multiplicity.
A070175 gives representatives for bigomega and omega, triangle A303555.
A355383 counts cmpsbl. pairs of partitions with containment, comps. A355384.
Cf. A000712, A022811, A056239, A071625, A181819, A319910, A339006.

tf=Table[Length[Select[Divisors[n],PrimeOmega[#]==PrimeNu[n]&]],{n,1000}];
Table[Position[tf,n][[1,1]],{n,Select[Union[tf],SubsetQ[tf,Range[#]]&]}]

A355387 Number of ways to choose a distinct subsequence of an integer composition of n.

Original entry on oeis.org

1, 2, 5, 14, 37, 98, 259, 682, 1791, 4697, 12303, 32196, 84199, 220087, 575067, 1502176, 3923117, 10244069, 26746171, 69825070, 182276806, 475804961, 1241965456, 3241732629, 8461261457, 22084402087, 57640875725, 150442742575, 392652788250, 1024810764496

Offset: 0

Gus Wiseman, Jul 04 2022

nonn

By "distinct" we mean equal subsequences are counted only once. For example, the pair (1,1)(1) is counted only once even though (1) is a subsequence of (1,1) in two ways. The version with multiplicity is A025192.

			The a(3) = 14 pairings of a composition with a chosen subsequence:
  (3)()     (3)(3)
  (21)()    (21)(1)   (21)(2)    (21)(21)
  (12)()    (12)(1)   (12)(2)    (12)(12)
  (111)()   (111)(1)  (111)(11)  (111)(111)

Christian Sievers, Table of n, a(n) for n = 0..2000

For partitions we have A000712, composable A339006.
The homogeneous version is A011782, without containment A000302.
With multiplicity we have A025192, for partitions A070933.
The strict case is A032005.
The case of strict subsequences is A236002.
The composable case is A355384, homogeneous without containment A355388.
A075900 counts compositions of each part of a partition.
A304961 counts compositions of each part of a strict partition.
A307068 counts strict compositions of each part of a composition.
A336127 counts compositions of each part of a strict composition.
Cf. A011782, A022811, A032020, A063834, A133494, A181591, A323583, A331330, A336128, A336130, A336139, A355382, A355383.

Table[Sum[Length[Union[Subsets[y]]],{y,Join@@Permutations/@IntegerPartitions[n]}],{n,0,6}]

lista(n)=my(f=sum(k=1,n,(x^k+x*O(x^n))/(1-x/(1-x)+x^k)));Vec((1-x)/((1-2*x)*(1-f))) \\ Christian Sievers, May 06 2025

G.f.: (1-x)/((1-2*x)*(1-f)) where f = Sum_{k>=1} x^k/(1-x/(1-x)+x^k) is the generating function for A331330. - Christian Sievers, May 06 2025

a(16) and beyond from Christian Sievers, May 06 2025

A355391 Position of first appearance of n in A181591 = binomial(bigomega(n), omega(n)).

Original entry on oeis.org

1, 4, 8, 16, 32, 24, 128, 256, 512, 48, 2048, 4096, 8192, 16384, 96, 65536, 131072, 262144, 524288, 240, 192, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 384, 536870912, 1073741824, 2147483648, 4294967296, 8589934592, 17179869184, 480, 768, 137438953472

Offset: 1

Gus Wiseman, Jul 04 2022

nonn

The statistic omega = A001221 counts distinct prime factors (without multiplicity).
The statistic bigomega = A001222 counts prime factors with multiplicity.
We have A181591(2^k) = k, so the sequence is fully defined. Positions meeting this maximum are A185024, complement A006987.

			The terms together with their prime indices begin:
       1: {}
       4: {1,1}
       8: {1,1,1}
      16: {1,1,1,1}
      32: {1,1,1,1,1}
      24: {1,1,1,2}
     128: {1,1,1,1,1,1,1}
     256: {1,1,1,1,1,1,1,1}
     512: {1,1,1,1,1,1,1,1,1}
      48: {1,1,1,1,2}
    2048: {1,1,1,1,1,1,1,1,1,1,1}
    4096: {1,1,1,1,1,1,1,1,1,1,1,1}
    8192: {1,1,1,1,1,1,1,1,1,1,1,1,1}
   16384: {1,1,1,1,1,1,1,1,1,1,1,1,1,1}
      96: {1,1,1,1,1,2}
   65536: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
  131072: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
  262144: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
  524288: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
     240: {1,1,1,1,2,3}
     192: {1,1,1,1,1,1,2}

Amiram Eldar, Table of n, a(n) for n = 1..168

Positions of powers of 2 are A185024, complement A006987.
Counting multiplicity gives A355386.
The sorted version is A355392.
A000005 counts divisors.
A001221 counts prime factors without multiplicity.
A001222 count prime factors with multiplicity.
A070175 gives representatives for bigomega and omega, triangle A303555.
Cf. A022811, A056239 , A071625, A118914, A181819, A323014, A323023, A355383 (with multiplicity A339006), A355384.

s=Table[Binomial[PrimeOmega[n],PrimeNu[n]],{n,1000}];
Table[Position[s,k][[1,1]],{k,Select[Union[s],SubsetQ[s,Range[#]]&]}]

f(n) = binomial(bigomega(n), omega(n)); \\ A181591
a(n) = my(k=1); while (f(k) != n, k++); k; \\ Michel Marcus, Jul 10 2022

binomial(bigomega(a(n)), omega(a(n))) = n.

a(22)-a(28) from Michel Marcus, Jul 10 2022

a(29)-a(37) from Amiram Eldar, Jul 10 2022

A355392 Sorted positions of first appearances in A181591 = binomial(bigomega(n), omega(n)).

Original entry on oeis.org

1, 4, 8, 16, 24, 32, 48, 96, 128, 192, 240, 256, 384, 480, 512, 768, 960, 1536, 1920, 2048, 3072, 3360, 3840, 4096, 6144, 6720, 7680, 8192, 12288, 13440, 15360, 16384, 24576, 26880, 30720, 49152, 53760, 61440, 65536, 73920, 107520, 122880, 131072, 147840, 196608

Offset: 1

Gus Wiseman, Jul 04 2022

nonn

These are the positions of terms in A181591 that are different from all prior terms.
The statistic omega = A001221 counts distinct prime factors (without multiplicity).
The statistic bigomega = A001222 counts prime factors with multiplicity.
We have A181591(2^k) = k, so the image under A181591 is a permutation of the positive integers. It begins: 1, 2, 3, 4, 6, 5, 10, 15, 7, 21, 20, ...

			The terms together with their prime indices begin:
    1: {}
    4: {1,1}
    8: {1,1,1}
   16: {1,1,1,1}
   24: {1,1,1,2}
   32: {1,1,1,1,1}
   48: {1,1,1,1,2}
   96: {1,1,1,1,1,2}
  128: {1,1,1,1,1,1,1}
  192: {1,1,1,1,1,1,2}
  240: {1,1,1,1,2,3}
  256: {1,1,1,1,1,1,1,1}
  384: {1,1,1,1,1,1,1,2}
  480: {1,1,1,1,1,2,3}
  512: {1,1,1,1,1,1,1,1,1}
  768: {1,1,1,1,1,1,1,1,2}
  960: {1,1,1,1,1,1,2,3}

Amiram Eldar, Table of n, a(n) for n = 1..210

The unsorted version with multiplicity is A355386.
This is the sorted version of A355391.
A000005 counts divisors.
A001221 counts prime indices without multiplicity.
A001222 count prime indices with multiplicity.
A070175 gives representatives for bigomega and omega, triangle A303555.
Cf. A000712, A022811, A056239, A071625, A118914, A181819, A323023, A355384.

s=Table[Binomial[PrimeOmega[n],PrimeNu[n]],{n,1000}];
Select[Range[Length[s]],FreeQ[Take[s,#-1],s[[#]]]&]

a(41)-a(45) from Amiram Eldar, Jul 10 2022

A081718 Array T(m,n) read by antidiagonals, where T(m,n) = number of m X infinity multiplicity integer partition (mip) matrix of n (m >= 0, n >= 0).

Original entry on oeis.org

1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 3, 3, 1, 0, 1, 1, 4, 6, 5, 1, 0, 1, 1, 5, 10, 13, 7, 1, 0, 1, 1, 6, 15, 26, 23, 11, 1, 0, 1, 1, 7, 21, 45, 55, 44, 15, 1, 0, 1, 1, 8, 28, 71, 110, 121, 74, 22, 1, 0, 1, 1, 9, 36, 105, 196, 271, 237, 129, 30, 1, 0, 1, 1, 10, 45, 148, 322, 532

Offset: 0

N. J. A. Sloane, Apr 05 2003

For n > 0, the n-th column is given by a polynomial of degree n-1. - David Wasserman, Jun 21 2004

			Array begins:
1 1 0 0 0 ...
1 1 1 1 1 ...
1 1 2 3 5 ...
1 1 3 6 13 ...

W. C. Yang, Derivatives are essentially integer partitions, Discrete Mathematics, 222(1-3), July 2000, 235-245.

Rows and columns give A022811, A022812, A022813, A022814, A022815, etc.

There is a recurrence involving the partition function.

More terms from David Wasserman, Jun 21 2004

A355390 Number of ordered pairs of distinct integer partitions of n.

Original entry on oeis.org

0, 0, 2, 6, 20, 42, 110, 210, 462, 870, 1722, 3080, 5852, 10100, 18090, 30800, 53130, 87912, 147840, 239610, 392502, 626472, 1003002, 1573770, 2479050, 3831806, 5931660, 9057090, 13819806, 20834660, 31399212, 46806122, 69697452, 102870306, 151523790, 221488806

Offset: 0

Gus Wiseman, Jul 04 2022

nonn

			The a(0) = 0 through a(3) = 6 pairs:
  .  .  (11)(2)  (21)(3)
        (2)(11)  (3)(21)
                 (111)(3)
                 (3)(111)
                 (111)(21)
                 (21)(111)

Without distinctness we have A001255, unordered A086737.
The version for compositions is A020522, unordered A006516.
The unordered version is A355389.
A000041 counts partitions, strict A000009.
A001970 counts multiset partitions of partitions.
A063834 counts partitions of each part of a partition.
Cf. A022811, A070933, A316245, A317715, A319910, A323433, A323583, A339006, A355385.

Table[Length[Select[Tuples[IntegerPartitions[n],2],UnsameQ@@#&]],{n,0,15}]

a(n) = 2*binomial(numbpart(n), 2); \\ Michel Marcus, Jul 05 2022

a(n) = 2*A355389(n) = 2*binomial(A000041(n), 2).

cp's OEIS Frontend

A022816 Number of terms in 6th derivative of a function composed with itself n times.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A355389 Number of unordered pairs of distinct integer partitions of n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A355386 Position of first appearance of n in A355382, where A355382(m) = number of divisors d of m such that bigomega(d) = omega(m); or a(n) = -1 if n does not appear in A355382.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A355387 Number of ways to choose a distinct subsequence of an integer composition of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A355391 Position of first appearance of n in A181591 = binomial(bigomega(n), omega(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A355392 Sorted positions of first appearances in A181591 = binomial(bigomega(n), omega(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A081718 Array T(m,n) read by antidiagonals, where T(m,n) = number of m X infinity multiplicity integer partition (mip) matrix of n (m >= 0, n >= 0).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula