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.

Showing 1-5 of 5 results.

A353400 Number of integer compositions of n with all run-lengths > 2.

Original entry on oeis.org

1, 0, 0, 1, 1, 1, 2, 1, 2, 4, 4, 5, 11, 11, 14, 27, 29, 37, 61, 72, 97, 147, 181, 246, 368, 470, 632, 914, 1198, 1611, 2286, 3018, 4079, 5709, 7619, 10329, 14333, 19258, 26142, 36069, 48688, 66114, 90800, 122913, 167020, 228735, 310167, 421708, 576499, 782803
Offset: 0

Views

Author

Gus Wiseman, May 15 2022

Keywords

Examples

			The a(7) = 1 through a(12) = 11 compositions:
  1111111   2222       333         22222        1112222       444
            11111111   111222      1111222      2222111       3333
                       222111      2221111      11111222      111333
                       111111111   1111111111   22211111      222222
                                                11111111111   333111
                                                              11112222
                                                              22221111
                                                              111111222
                                                              111222111
                                                              222111111
                                                              111111111111
		

Crossrefs

The = 2 version is A003242 aerated.
The <= 1 version is A003242 ranked by A333489.
The version for parts instead of run-lengths is A078012, both A353428.
The version for partitions is A100405.
The > 1 version is A114901, ranked by A353427.
The <= 2 version is A128695, matching A335464.
A008466 counts compositions with some part > 2.
A011782 counts compositions.
A106356 counts compositions by number of adjacent equal parts.
A274174 counts compositions with equal parts contiguous.
A329738 counts uniform compositions, partitions A047966.
A329739 counts compositions with all distinct run-lengths.

Programs

  • Maple
    b:= proc(n, h) option remember; `if`(n=0, 1, add(
         `if`(i<>h, add(b(n-i*j, i), j=3..n/i), 0), i=1..n/3))
        end:
    a:= n-> b(n, 0):
    seq(a(n), n=0..50);  # Alois P. Heinz, May 17 2022
  • Mathematica
    Table[Length[Select[Join@@Permutations/@ IntegerPartitions[n],!MemberQ[Length/@Split[#],1|2]&]],{n,0,15}]

Extensions

a(21)-a(49) from Alois P. Heinz, May 17 2022

A353502 Numbers with all prime indices and exponents > 2.

Original entry on oeis.org

1, 125, 343, 625, 1331, 2197, 2401, 3125, 4913, 6859, 12167, 14641, 15625, 16807, 24389, 28561, 29791, 42875, 50653, 68921, 78125, 79507, 83521, 103823, 117649, 130321, 148877, 161051, 166375, 205379, 214375, 226981, 274625, 279841, 300125, 300763, 357911
Offset: 1

Views

Author

Gus Wiseman, May 16 2022

Keywords

Comments

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.

Examples

			The initial terms together with their prime indices:
       1: {}
     125: {3,3,3}
     343: {4,4,4}
     625: {3,3,3,3}
    1331: {5,5,5}
    2197: {6,6,6}
    2401: {4,4,4,4}
    3125: {3,3,3,3,3}
    4913: {7,7,7}
    6859: {8,8,8}
   12167: {9,9,9}
   14641: {5,5,5,5}
   15625: {3,3,3,3,3,3}
   16807: {4,4,4,4,4}
   24389: {10,10,10}
   28561: {6,6,6,6}
   29791: {11,11,11}
   42875: {3,3,3,4,4,4}
		

Crossrefs

The version for only parts is A007310, counted by A008483.
The version for <= 2 instead of > 2 is A018256, # of compositions A137200.
The version for only multiplicities is A036966, counted by A100405.
The version for indices and exponents prime (instead of > 2) is:
- listed by A346068
- counted by A351982
- only exponents: A056166, counted by A055923
- only parts: A076610, counted by A000607
The version for > 1 instead of > 2 is A062739, counted by A339222.
The version for compositions is counted by A353428, see A078012, A353400.
The partitions with these Heinz numbers are counted by A353501.
A000726 counts partitions with multiplicities <= 2, compositions A128695.
A001222 counts prime factors with multiplicity, distinct A001221.
A004250 counts partitions with some part > 2, compositions A008466.
A056239 adds up prime indices, row sums of A112798 and A296150.
A124010 gives prime signature, sorted A118914.
A295341 counts partitions with some multiplicity > 2, compositions A335464.

Programs

  • Mathematica
    Select[Range[10000],#==1||!MemberQ[FactorInteger[#],{?(#<5&),}|{,?(#<3&)}]&]

Formula

Sum_{n>=1} 1/a(n) = Product_{p prime > 3} (1 + 1/(p^2*(p-1))) = (72/95)*A065483 = 1.0154153584... . - Amiram Eldar, May 28 2022

A353429 Number of integer compositions of n with all prime parts and all prime run-lengths.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 2, 0, 0, 1, 4, 0, 2, 2, 5, 4, 9, 1, 5, 12, 20, 11, 19, 18, 31, 43, 54, 37, 63, 95, 121, 124, 154, 178, 261, 353, 393, 417, 565, 770, 952, 1138, 1326, 1647, 2186, 2824, 3261, 3917, 4941, 6423, 7935, 9719, 11554, 14557, 18536, 23380, 27985
Offset: 0

Views

Author

Gus Wiseman, May 16 2022

Keywords

Examples

			The a(13) = 2 through a(16) = 9 compositions:
  (22333)  (77)       (555)     (3355)
  (33322)  (2255)     (33333)   (5533)
           (5522)     (222333)  (22255)
           (223322)   (333222)  (55222)
           (2222222)            (332233)
                                (2222233)
                                (2223322)
                                (2233222)
                                (3322222)
		

Crossrefs

The first condition only is A023360, partitions A000607.
For partitions we have A351982, only run-lens A100405, only parts A008483.
The second condition only is A353401, partitions A055923.
A003242 counts anti-run compositions, ranked by A333489.
A011782 counts compositions.
A052284 counts compositions into nonprimes, partitions A002095.
A106356 counts compositions by number of adjacent equal parts.
A114901 counts compositions with no runs of length 1, ranked by A353427.
A329738 counts uniform compositions, partitions A047966.

Programs

  • Maple
    b:= proc(n, h) option remember; `if`(n=0, 1, add(`if`(i<>h and isprime(i),
          add(`if`(isprime(j), b(n-i*j, i), 0), j=2..n/i), 0), i=2..n/2))
        end:
    a:= n-> b(n, 0):
    seq(a(n), n=0..70);  # Alois P. Heinz, May 18 2022
  • Mathematica
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[n], And@@PrimeQ/@#&&And@@PrimeQ/@Length/@Split[#]&]],{n,0,15}]

Extensions

a(26)-a(56) from Alois P. Heinz, May 18 2022

A353508 Number of integer compositions of n with no ones or runs of length 1.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 2, 0, 2, 1, 4, 0, 8, 2, 11, 4, 21, 5, 37, 12, 57, 25, 104, 38, 177, 79, 292, 149, 513, 251, 876, 482, 1478, 871, 2562, 1533, 4387, 2815, 7473, 5036, 12908, 8935, 22135, 16085, 37940, 28611, 65422, 50731, 112459, 90408, 193386, 160119, 333513
Offset: 0

Views

Author

Gus Wiseman, May 17 2022

Keywords

Examples

			The a(0) = 1 through a(14) = 11 compositions (empty columns indicated by dots, 0 is the empty composition):
  0  .  .  .  22  .  33   .  44    333  55     .  66      22333  77
                     222     2222       2233      444     33322  2255
                                        3322      2244           3344
                                        22222     3333           4433
                                                  4422           5522
                                                  22233          22244
                                                  33222          44222
                                                  222222         222233
                                                                 223322
                                                                 332222
                                                                 2222222
		

Crossrefs

The version for partitions is A339222.
Compositions counted by their run-lengths:
- For run-lengths <= 1 we have A003242, ranked by A333489.
- For run-lengths = 2 we have A003242 aerated.
- For run-lengths > 1 we have A114901, ranked by A353427.
- For run-lengths <= 2 we have A128695 matching A335464.
- For run-lengths > 2 we have A353400, partitions A100405.
- For run-lengths all prime we have A353401.
- For run-lengths and parts > 2 we have A353428.
A008466 counts compositions with some part > 2.
A011782 counts compositions.
A106356 counts compositions by number of adjacent equal parts.
A261983 counts non-anti-run compositions.
A274174 counts compositions with equal parts contiguous.

Programs

  • Maple
    b:= proc(n,h) option remember; `if`(n=0, 1, add(
         `if`(i<>h, add(b(n-i*j, i), j=2..n/i), 0), i=2..n/2))
        end:
    a:= n-> b(n, 0):
    seq(a(n), n=0..60);  # Alois P. Heinz, May 17 2022
  • Mathematica
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[n],!MemberQ[#,1]&&!MemberQ[Length/@Split[#],1]&]],{n,0,15}]

Extensions

a(41)-a(52) from Alois P. Heinz, May 17 2022

A353501 Number of integer partitions of n with all parts and all multiplicities > 2.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 2, 1, 0, 2, 0, 2, 3, 0, 0, 6, 2, 0, 6, 3, 2, 9, 2, 5, 11, 3, 5, 18, 6, 4, 20, 13, 8, 26, 10, 17, 37, 14, 16, 51, 23, 24, 58, 38, 32, 75, 44, 52, 100, 52, 59, 143, 75, 77, 159, 114, 112, 203, 132, 154, 266, 175
Offset: 0

Views

Author

Gus Wiseman, May 16 2022

Keywords

Examples

			The a(n) partitions for selected n (A = 10):
  n=9:   n=12:   n=21:      n=24:       n=30:
------------------------------------------------------
  (333)  (444)   (777)      (888)       (AAA)
         (3333)  (444333)   (6666)      (66666)
                 (3333333)  (444444)    (555555)
                            (555333)    (666444)
                            (4443333)   (777333)
                            (33333333)  (6663333)
                                        (55533333)
                                        (444333333)
                                        (3333333333)
		

Crossrefs

The version for only parts > 2 is A008483.
The version for only multiplicities > 2 is A100405.
The version for parts and multiplicities > 1 is A339222, ranked by A062739.
For prime parts and multiplicities we have A351982, compositions A353429.
The version for compositions is A353428 (partial A078012, A353400).
These partitions are ranked by A353502.
A000726 counts partitions with all mults <= 2, compositions A128695.
A004250 counts partitions with some part > 2, compositions A008466.
A137200 counts compositions with all parts and run-lengths <= 2.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Min@@#>2&&Min@@Length/@Split[#]>2&]],{n,0,30}]
Showing 1-5 of 5 results.