A107429 -id:A107429 - cp's OEIS frontend

A332296 Number of narrowly totally normal compositions of n.

1, 1, 2, 4, 5, 7, 13, 23, 30, 63, 120, 209, 369, 651, 1198, 2174, 3896, 7023, 12699, 22941, 41565

Offset: 0

Gus Wiseman, Feb 15 2020

A sequence is narrowly totally normal if either it is empty, a singleton (narrow), or it covers an initial interval of positive integers (normal) with narrowly totally normal run-lengths.

A composition of n is a finite sequence of positive integers summing to n.

			The a(0) = 1 through a(6) = 13 compositions:
  ()  (1)  (2)   (3)    (4)     (5)      (6)
           (11)  (12)   (112)   (122)    (123)
                 (21)   (121)   (212)    (132)
                 (111)  (211)   (221)    (213)
                        (1111)  (1121)   (231)
                                (1211)   (312)
                                (11111)  (321)
                                         (1212)
                                         (1221)
                                         (2112)
                                         (2121)
                                         (11211)
                                         (111111)
For example, starting with the composition (1,1,2,3,1,1) and repeatedly taking run-lengths gives (1,1,2,3,1,1) -> (2,1,1,2) -> (1,2,1) -> (1,1,1) -> (3). The first four are normal and the last is a singleton, so (1,1,2,3,1,1) is counted under a(9).

Normal compositions are A107429.
The wide version is A332279.
The wide recursive version (for partitions) is A332295.
The alternating version is A332296 (this sequence).
The strong version is A332336.
The co-strong version is (also) A332336.
Cf. A001462, A316496, A317081, A317245, A317491, A329744, A332276, A332277, A332278, A332297, A332337, A332340.

tinQ[q_]:=Or[Length[q]<=1,And[Union[q]==Range[Max[q]],tinQ[Length/@Split[q]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],tinQ]],{n,0,10}]

For n > 1, a(n) = A332279(n) + 1.

A332336 Number of narrowly totally strongly normal compositions of n.

Original entry on oeis.org

1, 1, 2, 4, 4, 4, 10, 10, 13, 24, 55, 78, 117, 206, 353, 698, 1175, 2014, 3539, 6210, 10831

Offset: 0

Gus Wiseman, Feb 15 2020

A sequence is narrowly totally strongly normal if either it is empty, a singleton (narrow), or it covers an initial interval of positive integers (normal) and has weakly decreasing run-lengths (strong) that are themselves a narrowly totally strongly normal sequence.

A composition of n is a finite sequence of positive integers summing to n.

			The a(1) = 1 through a(8) = 13 compositions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (12)   (112)   (212)    (123)     (1213)     (1232)
             (21)   (121)   (221)    (132)     (1231)     (2123)
             (111)  (1111)  (11111)  (213)     (1312)     (2132)
                                     (231)     (1321)     (2312)
                                     (312)     (2131)     (2321)
                                     (321)     (3121)     (3212)
                                     (1212)    (11221)    (12131)
                                     (2121)    (12121)    (13121)
                                     (111111)  (1111111)  (21212)
                                                          (22112)
                                                          (111221)
                                                          (11111111)
For example, starting with (22112) and repeated taking run-lengths gives (22112) -> (221) -> (21) -> (11) -> (2). The first four are normal with weakly decreasing run-lengths, and the last is a singleton, so (22112) is counted under a(8).

Normal compositions are A107429.
The non-strong version is A332296.
The case of partitions is A332297.
The co-strong version is A332336 (this sequence).
The wide version is A332337.
Cf. A025487, A316496, A317081, A317245, A317256, A317491, A329744, A332279, A332291, A332292, A332338, A332340.

tinQ[q_]:=Or[q=={},Length[q]==1,And[Union[q]==Range[Max[q]],GreaterEqual@@Length/@Split[q],tinQ[Length/@Split[q]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],tinQ]],{n,0,10}]

For n > 1, a(n) = A332337(n) + 1.

A072707 Number of non-unimodal compositions of n into distinct terms.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 2, 2, 4, 6, 24, 26, 46, 64, 100, 224, 276, 416, 590, 850, 1144, 2214, 2644, 3938, 5282, 7504, 9776, 13704, 21984, 27632, 38426, 51562, 69844, 91950, 123504, 159658, 246830, 303400, 416068, 540480, 730268, 933176, 1248110

Offset: 0

Henry Bottomley, Jul 04 2002

Also the number of compositions of n into distinct terms whose negation is not unimodal. - Gus Wiseman, Mar 05 2020

			a(6)=2 since 6 can be written as 2+1+3 or 3+1+2.
From _Gus Wiseman_, Mar 05 2020: (Start)
The a(6) = 2 through a(9) = 6 strict compositions:
  (2,1,3)  (2,1,4)  (2,1,5)  (2,1,6)
  (3,1,2)  (4,1,2)  (3,1,4)  (3,1,5)
                    (4,1,3)  (3,2,4)
                    (5,1,2)  (4,2,3)
                             (5,1,3)
                             (6,1,2)
(End)

Eric Weisstein's World of Mathematics, Unimodal Sequence

The complement is counted by A072706.
The non-strict version is A115981.
The case where the negation is not unimodal either is A332874.
Unimodal compositions are A001523.
Strict compositions are A032020.
Non-unimodal permutations are A059204.
A triangle for strict unimodal compositions is A072705.
Non-unimodal sequences covering an initial interval are A328509.
Numbers whose prime signature is not unimodal are A332282.
Strict partitions whose 0-appended differences are not unimodal are A332286.
Compositions whose negation is unimodal are A332578.
Compositions whose negation is not unimodal are A332669.
Non-unimodal compositions covering an initial interval are A332743.
Cf. A007052, A072704, A107429, A227038, A329398, A332281, A332284, A332285, A332579, A332870.

unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],UnsameQ@@#&&!unimodQ[#]&]],{n,0,16}] (* Gus Wiseman, Mar 05 2020 *)

a(n) = A032020(n) - A072706(n) = Sum_{k} A059204(k) * A060016(n, k).

A251729 Number of gap-free but not complete compositions of n.

Original entry on oeis.org

0, 1, 1, 2, 3, 3, 6, 6, 14, 12, 27, 33, 58, 86, 134, 210, 323, 539, 810, 1371, 2044, 3510, 5263, 8927, 13702, 22870, 35821, 58750, 93343, 152236, 243244, 395078, 634342, 1027876, 1656543, 2676693, 4325727, 6982440, 11299457, 18232217, 29518334, 47641410

Offset: 1

Alois P. Heinz, Dec 07 2014

nonn

A composition is gap-free but not complete if all integers in the interval defined by the smallest and the largest part are parts but 1 is not a part.

			a(6) = 3: [6], [3,3], [2,2,2].
a(7) = 6: [7], [3,4], [4,3], [2,2,3], [2,3,2], [3,2,2].

Alois P. Heinz, Table of n, a(n) for n = 1..1000
Alois P. Heinz, Plot of (a(n)+a(n+1)-a(n+2))/a(n+2) for n = 150..1000
P. Hitczenko and A. Knopfmacher, Gap-free compositions and gap-free samples of geometric random variables, Discrete Math., 294 (2005), 225-239.

Cf. A001622, A034296, A107428, A107429, A188575, A238353, A264396.

b:= proc(n, i, t) option remember; `if`(n=0, `if`(i=0, 0, t!),
     `if`(i<1 or n add(b(n, i, 0), i=1..n):
seq(a(n), n=1..50);

b[n_, i_, t_] := b[n, i, t] = If[n == 0, If[i == 0, 0, t!], If[i < 1 || n < i, 0, Sum[b[n - i*j, i - 1, t + j]/j!, {j, 1, n/i}]]];
a[n_] := Sum[b[n, i, 0], {i, 1, n}];
Array[a, 50] (* Jean-François Alcover, Jan 25 2021, after Alois P. Heinz *)

a(n) = A107428(n) - A107429(n).

lim_{n -> oo} a(n)/a(n-1) = (1+sqrt(5))/2 = phi = A001622.

A332279 Number of widely totally normal compositions of n.

Original entry on oeis.org

1, 1, 1, 3, 4, 6, 12, 22, 29, 62, 119, 208, 368, 650, 1197, 2173, 3895, 7022, 12698, 22940, 41564

Offset: 0

Gus Wiseman, Feb 12 2020

A sequence is widely totally normal if either it is all 1's (wide) or it covers an initial interval of positive integers (normal) and has widely totally normal run-lengths.

A composition of n is a finite sequence of positive integers with sum n.

			The a(1) = 1 through a(7) = 22 compositions:
  (1)  (11)  (12)   (112)   (122)    (123)     (1123)
             (21)   (121)   (212)    (132)     (1132)
             (111)  (211)   (221)    (213)     (1213)
                    (1111)  (1121)   (231)     (1231)
                            (1211)   (312)     (1312)
                            (11111)  (321)     (1321)
                                     (1212)    (2113)
                                     (1221)    (2122)
                                     (2112)    (2131)
                                     (2121)    (2212)
                                     (11211)   (2311)
                                     (111111)  (3112)
                                               (3121)
                                               (3211)
                                               (11221)
                                               (12112)
                                               (12121)
                                               (12211)
                                               (21121)
                                               (111211)
                                               (112111)
                                               (1111111)
For example, starting with y = (3,2,1,1,2,2,2,1,2,1,1,1,1) and repeatedly taking run-lengths gives y -> (1,1,2,3,1,1,4) -> (2,1,1,2,1) -> (1,2,1,1) -> (1,1,2) -> (2,1) -> (1,1). These are all normal and the last is all 1's, so y is counted under a(20).

Normal compositions are A107429.
Constantly recursively normal partitions are A332272.
The case of partitions is A332277.
The case of reversed partitions is (also) A332277.
The narrow version is A332296.
The strong version is A332337.
The co-strong version is (also) A332337.
Cf. A001462, A181819, A182850, A317081, A317245, A317491, A329744, A332276, A332289, A332292, A332295, A332297, A332336, A332340.

recnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[ptn]==Range[Max[ptn]],recnQ[Length/@Split[ptn]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],recnQ]],{n,0,10}]

For n > 1, a(n) = A332296(n) - 1.

A333150 Number of strict compositions of n whose non-adjacent parts are strictly decreasing.

Original entry on oeis.org

1, 1, 1, 3, 3, 5, 8, 10, 13, 18, 26, 31, 42, 52, 68, 89, 110, 136, 173, 212, 262, 330, 398, 487, 592, 720, 864, 1050, 1262, 1508, 1804, 2152, 2550, 3037, 3584, 4236, 5011, 5880, 6901, 8095, 9472, 11048, 12899, 14996, 17436, 20261, 23460, 27128, 31385, 36189

Offset: 0

Gus Wiseman, May 16 2020

nonn

A composition of n is a finite sequence of positive integers summing to n. It is strict if there are no repeated parts.

			The a(1) = 1 through a(8) = 13 compositions:
  (1)  (2)  (3)    (4)    (5)    (6)      (7)      (8)
            (1,2)  (1,3)  (1,4)  (1,5)    (1,6)    (1,7)
            (2,1)  (3,1)  (2,3)  (2,4)    (2,5)    (2,6)
                          (3,2)  (4,2)    (3,4)    (3,5)
                          (4,1)  (5,1)    (4,3)    (5,3)
                                 (2,3,1)  (5,2)    (6,2)
                                 (3,1,2)  (6,1)    (7,1)
                                 (3,2,1)  (2,4,1)  (2,5,1)
                                          (4,1,2)  (3,4,1)
                                          (4,2,1)  (4,1,3)
                                                   (4,3,1)
                                                   (5,1,2)
                                                   (5,2,1)
For example, (3,5,1,2) is such a composition, because the non-adjacent pairs of parts are (3,1), (3,2), (5,2), all of which are strictly decreasing.

Andrew Howroyd, Table of n, a(n) for n = 0..1000

The case of permutations appears to be A000045(n + 1).
Unimodal strict compositions are A072706.
A version for ordered set partitions is A332872.
The non-strict version is A333148.
Cf. A001523, A028859, A056242, A059204, A107429, A115981, A329398, A332578, A332669, A332673, A332724, A332834, A333193.

Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],UnsameQ@@#&&!MatchQ[#,{_,x_,,y_,_}/;y>x]&]],{n,0,10}]

seq(n)={my(p=prod(k=1, n, 1 + y*x^k + O(x*x^n))); Vec(sum(k=0, n, fibonacci(k+1) * polcoef(p,k,y)))} \\ Andrew Howroyd, Apr 16 2021

G.f.: Sum_{k>=0} Fibonacci(k+1) * [y^k](Product_{j>=1} 1 + y*x^j). - Andrew Howroyd, Apr 16 2021

A371292 Numbers whose binary indices have prime indices covering an initial interval of positive integers.

Original entry on oeis.org

0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 22, 23, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 86, 87, 92, 93, 94, 95, 112, 113, 114, 115, 116, 117, 118, 119

Offset: 0

Gus Wiseman, Mar 27 2024

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

			The terms together with their prime indices of binary indices begin:
   0: {}
   1: {{}}
   2: {{1}}
   3: {{},{1}}
   6: {{1},{2}}
   7: {{},{1},{2}}
   8: {{1,1}}
   9: {{},{1,1}}
  10: {{1},{1,1}}
  11: {{},{1},{1,1}}
  12: {{2},{1,1}}
  13: {{},{2},{1,1}}
  14: {{1},{2},{1,1}}
  15: {{},{1},{2},{1,1}}
  22: {{1},{2},{3}}
  23: {{},{1},{2},{3}}
  28: {{2},{1,1},{3}}
  29: {{},{2},{1,1},{3}}
  30: {{1},{2},{1,1},{3}}
  31: {{},{1},{2},{1,1},{3}}
  32: {{1,2}}

John Tyler Rascoe, Table of n, a(n) for n = 0..10000

The case with squarefree product of prime indices is A371293.
For binary indices of each prime index we have A371447, A371448.
The connected components of this multiset system are counted by A371452.
A000009 counts partitions covering initial interval, compositions A107429.
A000670 counts patterns, ranked by A333217.
A011782 counts multisets covering an initial interval.
A048793 lists binary indices, A000120 length, A272020 reverse, A029931 sum.
A070939 gives length of binary expansion.
A131689 counts patterns by number of distinct parts.
Cf. A000040, A001222, A055887, A255906, A326782, A368109, A371291, A371294.

normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[0,100],normQ[Join@@prix/@bpe[#]]&]

from itertools import count, islice
from sympy import sieve, factorint
def a_gen():
    for n in count(0):
        s = set()
        b = [(i+1) for i, x in enumerate(bin(n)[2:][::-1]) if x =='1']
        for i in b:
            p = factorint(i)
            for j in p:
                s.add(sieve.search(j)[0])
        x = sorted(s)
        y = len(x)
        if sum(x) == (y*(y+1))//2:
            yield n
A371292_list = list(islice(a_gen(), 65)) # John Tyler Rascoe, May 21 2024

A373118 Number T(n,k) of compositions of n such that the set of parts is [k]; triangle T(n,k), n>=0, 0<=k<=A003056(n), read by rows.

Original entry on oeis.org

1, 0, 1, 0, 1, 0, 1, 2, 0, 1, 3, 0, 1, 7, 0, 1, 11, 6, 0, 1, 20, 12, 0, 1, 32, 32, 0, 1, 54, 72, 0, 1, 87, 152, 24, 0, 1, 143, 311, 60, 0, 1, 231, 625, 180, 0, 1, 376, 1225, 450, 0, 1, 608, 2378, 1116, 0, 1, 986, 4566, 2544, 120, 0, 1, 1595, 8700, 5752, 360

Offset: 0

Alois P. Heinz, May 25 2024

			T(6,2) = 11: 1122, 1212, 1221, 2112, 2121, 2211, 11112, 11121, 11211, 12111, 21111.
T(7,3) = 12: 1123, 1132, 1213, 1231, 1312, 1321, 2113, 2131, 2311, 3112, 3121, 3211.
Triangle T(n,k) begins:
  1;
  0, 1;
  0, 1;
  0, 1,   2;
  0, 1,   3;
  0, 1,   7;
  0, 1,  11,    6;
  0, 1,  20,   12;
  0, 1,  32,   32;
  0, 1,  54,   72;
  0, 1,  87,  152,   24;
  0, 1, 143,  311,   60;
  0, 1, 231,  625,  180;
  0, 1, 376, 1225,  450;
  0, 1, 608, 2378, 1116;
  0, 1, 986, 4566, 2544, 120;
  ...

Alois P. Heinz, Rows n = 0..750, flattened

Columns k=0-3 give: A000007, A057427, A245738, A372702.
Row sums give A107429.
Cf. A000124, A000142, A000217, A000290, A001710, A003056, A008289, A332721, A371417, A373305, A373306.

b:= proc(n, i, t) option remember; `if`(n=0, `if`(i=0, t!, 0),
     `if`(i<1 or n b(n, k, 0):
seq(seq(T(n, k), k=0..floor((sqrt(1+8*n)-1)/2)), n=0..18);

T(A000217(n),n) = n! = A000142(n).
T(A000124(n),n) = A001710(n+1) for n>=1.
T(A000290(n),n) = T(n^2,n) = A332721(n).
G.f. for column k: C({1..k},x) where C({s},x) = Sum_{i in {s}} (C({s}-{i},x)*x^i)/ (1 - Sum_{i in {s}} (x^i)) with C({},x) = 1. - John Tyler Rascoe, May 25 2024

A072705 Triangle of number of unimodal compositions of n into exactly k distinct terms.

Original entry on oeis.org

1, 1, 0, 1, 2, 0, 1, 2, 0, 0, 1, 4, 0, 0, 0, 1, 4, 4, 0, 0, 0, 1, 6, 4, 0, 0, 0, 0, 1, 6, 8, 0, 0, 0, 0, 0, 1, 8, 12, 0, 0, 0, 0, 0, 0, 1, 8, 16, 8, 0, 0, 0, 0, 0, 0, 1, 10, 20, 8, 0, 0, 0, 0, 0, 0, 0, 1, 10, 28, 16, 0, 0, 0, 0, 0, 0, 0, 0, 1, 12, 32, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 12, 40, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Henry Bottomley, Jul 04 2002

Also the number of compositions of n into exactly k distinct terms whose negation is unimodal. - Gus Wiseman, Mar 06 2020

			Rows start: 1; 1,0; 1,2,0; 1,2,0,0; 1,4,0,0,0; 1,4,4,0,0,0; 1,6,4,0,0,0,0; 1,6,8,0,0,0,0,0; etc. T(6,3)=4 since 6 can be written as 1+2+3, 1+3+2, 2+3+1, or 3+2+1 but not 2+1+3 or 3+1+2.
From _Gus Wiseman_, Mar 06 2020: (Start)
Triangle begins:
  1
  1  0
  1  2  0
  1  2  0  0
  1  4  0  0  0
  1  4  4  0  0  0
  1  6  4  0  0  0  0
  1  6  8  0  0  0  0  0
  1  8 12  0  0  0  0  0  0
  1  8 16  8  0  0  0  0  0  0
  1 10 20  8  0  0  0  0  0  0  0
  1 10 28 16  0  0  0  0  0  0  0  0
  1 12 32 24  0  0  0  0  0  0  0  0  0
  1 12 40 40  0  0  0  0  0  0  0  0  0  0
  1 14 48 48 16  0  0  0  0  0  0  0  0  0  0
(End)

Alois P. Heinz, Rows n = 1..141, flattened

Cf. A060016, A072574, A072704. Row sums are A072706.
Column k = 2 is A052928.
Unimodal compositions are A001523.
Unimodal sequences covering an initial interval are A007052.
Strict compositions are A032020.
Non-unimodal strict compositions are A072707.
Unimodal compositions covering an initial interval are A227038.
Numbers whose prime signature is not unimodal are A332282.
Cf. A059204, A107429, A115981, A329398, A332285, A332286, A332578, A332870, A332874.

b:= proc(n, i) option remember; `if`(n>i*(i+1)/2, 0, `if`(n=0, 1,
      expand(b(n, i-1) +`if`(i>n, 0, x*b(n-i, i-1)))))
    end:
T:= n-> (p-> seq(coeff(p, x, i)*ceil(2^(i-1)), i=1..n))(b(n$2)):
seq(T(n), n=1..14);  # Alois P. Heinz, Mar 26 2014

b[n_, i_] := b[n, i] = If[n > i*(i+1)/2, 0, If[n == 0, 1, Expand[b[n, i-1] + If[i > n, 0, x*b[n-i, i-1]]]]]; T[n_] := Function[{p}, Table[Coefficient[p, x, i]* Ceiling[2^(i-1)], {i, 1, n}]][b[n, n]]; Table[T[n], {n, 1, 14}] // Flatten (* Jean-François Alcover, Feb 26 2015, after Alois P. Heinz *)
unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n,{k}],UnsameQ@@#&&unimodQ[#]&]],{n,12},{k,n}] (* Gus Wiseman, Mar 06 2020 *)

T(n,k) = 2^(k-1)*A060016(n,k) = T(n-k,k)+2*T(n-k,k-1) [starting with T(0,0)=0, T(0,1)=0 and T(n,1)=1 for n>0].

A329741 Number of compositions of n whose multiplicities cover an initial interval of positive integers.

Original entry on oeis.org

1, 1, 1, 3, 6, 11, 14, 34, 52, 114, 225, 464, 539, 1183, 1963, 3753, 6120, 11207, 19808, 38254, 77194, 147906, 224853, 374216, 611081, 1099933, 2129347, 3336099, 5816094, 9797957, 17577710, 29766586, 53276392, 93139668, 163600815, 324464546, 637029845, 1010826499

Offset: 0

Gus Wiseman, Nov 20 2019

nonn

A composition of n is a finite sequence of positive integers with sum n.

			The a(1) = 1 through a(6) = 14 compositions:
  (1)  (2)  (3)    (4)      (5)      (6)
            (1,2)  (1,3)    (1,4)    (1,5)
            (2,1)  (3,1)    (2,3)    (2,4)
                   (1,1,2)  (3,2)    (4,2)
                   (1,2,1)  (4,1)    (5,1)
                   (2,1,1)  (1,1,3)  (1,1,4)
                            (1,2,2)  (1,2,3)
                            (1,3,1)  (1,3,2)
                            (2,1,2)  (1,4,1)
                            (2,2,1)  (2,1,3)
                            (3,1,1)  (2,3,1)
                                     (3,1,2)
                                     (3,2,1)
                                     (4,1,1)

Looking at run-lengths instead of multiplicities gives A329766.
The complete case is A329748.
Complete compositions are A107429.
Cf. A000740, A008965, A098504, A242882, A244164, A329738, A329739, A329740.

normQ[m_]:=Or[m=={},Union[m]==Range[Max[m]]];
Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],normQ[Length/@Split[Sort[#]]]&]],{n,20}]

a(0), a(21)-a(37) from Alois P. Heinz, Nov 21 2019

cp's OEIS Frontend

A332296 Number of narrowly totally normal compositions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A332336 Number of narrowly totally strongly normal compositions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A072707 Number of non-unimodal compositions of n into distinct terms.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A251729 Number of gap-free but not complete compositions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A332279 Number of widely totally normal compositions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A333150 Number of strict compositions of n whose non-adjacent parts are strictly decreasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A371292 Numbers whose binary indices have prime indices covering an initial interval of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

A373118 Number T(n,k) of compositions of n such that the set of parts is [k]; triangle T(n,k), n>=0, 0<=k<=A003056(n), read by rows.

Views

Author