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.

Previous Showing 11-20 of 40 results. Next

A332284 Number of integer partitions of n whose first differences (assuming the last part is zero) are not unimodal.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 2, 4, 6, 12, 18, 28, 42, 62, 86, 123, 168, 226, 306, 411, 534, 704, 908, 1165, 1492, 1898, 2384, 3011, 3758, 4673, 5799, 7168, 8792, 10804, 13192, 16053, 19505, 23633, 28497, 34367, 41283, 49470, 59188, 70675, 84113, 100048, 118689, 140533
Offset: 0

Views

Author

Gus Wiseman, Feb 20 2020

Keywords

Comments

A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

Examples

			The a(6) = 1 through a(11) = 18 partitions:
  (2211)  (331)    (431)     (441)      (541)       (551)
          (22111)  (3311)    (4311)     (3322)      (641)
                   (22211)   (32211)    (3331)      (4331)
                   (221111)  (33111)    (4411)      (4421)
                             (222111)   (33211)     (5411)
                             (2211111)  (42211)     (33221)
                                        (43111)     (33311)
                                        (222211)    (44111)
                                        (322111)    (52211)
                                        (331111)    (322211)
                                        (2221111)   (332111)
                                        (22111111)  (422111)
                                                    (431111)
                                                    (2222111)
                                                    (3221111)
                                                    (3311111)
                                                    (22211111)
                                                    (221111111)
		

Crossrefs

The complement is counted by A332283.
The strict version is A332286.
The Heinz numbers of these partitions are A332287.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Non-unimodal normal sequences appear to be A328509.
Partitions with non-unimodal run-lengths are A332281.
Heinz numbers of partitions with non-unimodal run-lengths are A332282.

Programs

  • Mathematica
    unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
    Table[Length[Select[IntegerPartitions[n],!unimodQ[Differences[Append[#,0]]]&]],{n,30}]

A332745 Number of integer partitions of n whose run-lengths are either weakly increasing or weakly decreasing.

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 21, 29, 39, 51, 68, 87, 113, 143, 183, 228, 289, 354, 443, 544, 672, 812, 1001, 1202, 1466, 1758, 2123, 2525, 3046, 3606, 4308, 5089, 6054, 7102, 8430, 9855, 11621, 13571, 15915, 18500, 21673, 25103, 29245, 33835, 39296, 45277, 52470
Offset: 0

Views

Author

Gus Wiseman, Feb 29 2020

Keywords

Comments

Also partitions whose run-lengths and negated run-lengths are both unimodal.

Examples

			The a(8) = 21 partitions are:
  (8)     (44)     (2222)
  (53)    (332)    (22211)
  (62)    (422)    (32111)
  (71)    (431)    (221111)
  (521)   (3311)   (311111)
  (611)   (4211)   (2111111)
  (5111)  (41111)  (11111111)
Missing from this list is only (3221).
		

Crossrefs

The complement is counted by A332641.
The Heinz numbers of partitions not in this class are A332831.
The case of run-lengths of compositions is A332835.
Only weakly decreasing is A100882.
Only weakly increasing is A100883.
Unimodal compositions are A001523.
Non-unimodal compositions are A115981.
Partitions with unimodal run-lengths are A332280.
Partitions whose negated run-lengths are unimodal are A332638.
Compositions with unimodal run-lengths are A332726.
Compositions that are neither weakly increasing nor decreasing are A332834.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Or[LessEqual@@Length/@Split[#],GreaterEqual@@Length/@Split[#]]&]],{n,0,30}]

A332287 Heinz numbers of integer partitions whose first differences (assuming the last part is zero) are not unimodal.

Original entry on oeis.org

36, 50, 70, 72, 98, 100, 108, 140, 144, 154, 180, 182, 196, 200, 216, 225, 242, 250, 252, 280, 286, 288, 294, 300, 308, 324, 338, 350, 360, 363, 364, 374, 392, 396, 400, 418, 429, 432, 441, 442, 450, 462, 468, 484, 490, 494, 500, 504, 507, 540, 550, 560, 561
Offset: 1

Views

Author

Gus Wiseman, Feb 21 2020

Keywords

Comments

A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), which gives a bijective correspondence between positive integers and integer partitions.

Examples

			The sequence of terms together with their prime indices begins:
   36: {1,1,2,2}
   50: {1,3,3}
   70: {1,3,4}
   72: {1,1,1,2,2}
   98: {1,4,4}
  100: {1,1,3,3}
  108: {1,1,2,2,2}
  140: {1,1,3,4}
  144: {1,1,1,1,2,2}
  154: {1,4,5}
  180: {1,1,2,2,3}
  182: {1,4,6}
  196: {1,1,4,4}
  200: {1,1,1,3,3}
  216: {1,1,1,2,2,2}
  225: {2,2,3,3}
  242: {1,5,5}
  250: {1,3,3,3}
  252: {1,1,2,2,4}
  280: {1,1,1,3,4}
For example, the prime indices of 70 with 0 appended are (4,3,1,0), with differences (-1,-2,-1), which is not unimodal, so 70 belongs to the sequence.
		

Crossrefs

The enumeration of these partitions by sum is A332284.
Not assuming the last part is zero gives A332725.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Non-unimodal normal sequences are A328509.
Partitions with non-unimodal run-lengths are A332281.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
    Select[Range[1000],!unimodQ[Differences[Append[Reverse[primeMS[#]],0]]]&]

A332288 Number of unimodal permutations of the multiset of prime indices of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 2, 1, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 1, 3, 1, 4, 1, 1, 2, 2, 2, 3, 1, 2, 2, 4, 1, 4, 1, 3, 3, 2, 1, 5, 1, 2, 2, 3, 1, 2, 2, 4, 2, 2, 1, 6, 1, 2, 3, 1, 2, 4, 1, 3, 2, 4, 1, 4, 1, 2, 2, 3, 2, 4, 1, 5, 1, 2, 1, 6, 2, 2, 2
Offset: 1

Views

Author

Gus Wiseman, Feb 22 2020

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.
A sequence of integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.
Also permutations of the multiset of prime indices of n avoiding the patterns (2,1,2), (2,1,3), and (3,1,2).

Examples

			The a(n) permutations for n = 2, 6, 12, 24, 48, 60, 120, 180:
  (1)  (12)  (112)  (1112)  (11112)  (1123)  (11123)  (11223)
       (21)  (121)  (1121)  (11121)  (1132)  (11132)  (11232)
             (211)  (1211)  (11211)  (1231)  (11231)  (11322)
                    (2111)  (12111)  (1321)  (11321)  (12231)
                            (21111)  (2311)  (12311)  (12321)
                                     (3211)  (13211)  (13221)
                                             (23111)  (22311)
                                             (32111)  (23211)
                                                      (32211)
		

Crossrefs

Dominated by A008480.
A more interesting version is A332294.
The complement is counted by A332671.
Unimodal compositions are A001523.
Unimodal normal sequences appear to be A007052.
Unimodal permutations are A011782.
Non-unimodal permutations are A059204.
Numbers with non-unimodal unsorted prime signature are A332282.
Partitions with unimodal 0-appended first differences are A332283.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
    Table[Length[Select[Permutations[primeMS[n]],unimodQ]],{n,30}]

A332286 Number of strict integer partitions of n whose first differences (assuming the last part is zero) are not unimodal.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 3, 5, 5, 7, 9, 12, 15, 22, 23, 31, 40, 47, 58, 72, 81, 100, 122, 144, 171, 206, 236, 280, 333, 381, 445, 522, 593, 694, 802, 914, 1054, 1214, 1376, 1577, 1803, 2040, 2324, 2646, 2973, 3373, 3817, 4287, 4838, 5453, 6096, 6857
Offset: 0

Views

Author

Gus Wiseman, Feb 21 2020

Keywords

Comments

A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.
Also the number integer partitions of n that cover an initial interval of positive integers and whose negated run-lengths are not unimodal.

Examples

			The a(8) = 1 through a(18) = 7 partitions:
  (431)  .  (541)  (641)  (651)   (652)   (752)   (762)   (862)
                          (5421)  (751)   (761)   (861)   (871)
                                  (5431)  (851)   (6531)  (961)
                                          (6431)  (7431)  (6532)
                                          (6521)  (7521)  (6541)
                                                          (7621)
                                                          (8431)
For example, (4,3,1,0) has first differences (-1,-2,-1), which is not unimodal, so (4,3,1) is counted under a(8).
		

Crossrefs

Strict partitions are A000009.
Partitions covering an initial interval are (also) A000009.
The non-strict version is A332284.
The complement is counted by A332285.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Non-unimodal normal sequences are A328509.
Partitions with non-unimodal run-lengths are A332281.
Normal partitions whose run-lengths are not unimodal are A332579.

Programs

  • Mathematica
    unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
    Table[Length[Select[IntegerPartitions[n],And[UnsameQ@@#,!unimodQ[Differences[Append[#,0]]]]&]],{n,0,30}]

A332640 Number of integer partitions of n such that neither the run-lengths nor the negated run-lengths are unimodal.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 4, 6, 12, 17, 29, 44, 66, 92, 138, 187, 266, 359, 492, 649, 877, 1140, 1503, 1938, 2517, 3202, 4111, 5175, 6563, 8209, 10297, 12763, 15898, 19568, 24152, 29575, 36249, 44090, 53737, 65022, 78752, 94873, 114294
Offset: 0

Views

Author

Gus Wiseman, Feb 25 2020

Keywords

Comments

A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

Examples

			The a(14) = 1 through a(18) = 12 partitions:
  (433211)  (533211)   (443221)    (544211)     (544311)
            (4332111)  (633211)    (733211)     (553221)
                       (5332111)   (4333211)    (644211)
                       (43321111)  (6332111)    (833211)
                                   (53321111)   (4432221)
                                   (433211111)  (5333211)
                                                (5442111)
                                                (7332111)
                                                (43332111)
                                                (63321111)
                                                (533211111)
                                                (4332111111)
For example, the partition (4,3,3,2,1,1) has run-lengths (1,2,1,2), so is counted under a(14).
		

Crossrefs

Looking only at the original run-lengths gives A332281.
Looking only at the negated run-lengths gives A332639.
The Heinz numbers of these partitions are A332643.
The complement is counted by A332746.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Partitions with unimodal run-lengths are A332280.
Partitions whose negated run-lengths are unimodal are A332638.
Run-lengths and negated run-lengths are not both unimodal: A332641.
Compositions whose negation is not unimodal are A332669.
Run-lengths and negated run-lengths are both unimodal: A332745.

Programs

  • Mathematica
    unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]]
    Table[Length[Select[IntegerPartitions[n],!unimodQ[Length/@Split[#]]&&!unimodQ[-Length/@Split[#]]&]],{n,0,30}]

A332641 Number of integer partitions of n whose run-lengths are neither weakly increasing nor weakly decreasing.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 9, 14, 22, 33, 48, 69, 96, 136, 184, 248, 330, 443, 574, 756, 970, 1252, 1595, 2040, 2558, 3236, 4041, 5054, 6256, 7781, 9547, 11782, 14394, 17614, 21423, 26083, 31501, 38158, 45930, 55299, 66262, 79477, 94803, 113214
Offset: 0

Views

Author

Gus Wiseman, Feb 26 2020

Keywords

Comments

Also partitions whose run-lengths and negated run-lengths are not both unimodal. A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

Examples

			The a(8) = 1 through a(13) = 14 partitions:
  (3221)  (4221)  (5221)   (4331)    (4332)     (5332)
                  (32221)  (6221)    (5331)     (6331)
                  (33211)  (42221)   (7221)     (8221)
                           (322211)  (43221)    (43321)
                           (332111)  (44211)    (44311)
                                     (52221)    (53221)
                                     (322221)   (62221)
                                     (422211)   (332221)
                                     (3321111)  (333211)
                                                (422221)
                                                (442111)
                                                (522211)
                                                (3222211)
                                                (33211111)
		

Crossrefs

The complement is counted by A332745.
The Heinz numbers of these partitions are A332831.
The case of run-lengths of compositions is A332833.
Partitions whose run-lengths are weakly increasing are A100883.
Partitions whose run-lengths are weakly decreasing are A100882.
Partitions whose run-lengths are not unimodal are A332281.
Partitions whose negated run-lengths are not unimodal are A332639.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Partitions with unimodal run-lengths are A332280.
Partitions whose negated run-lengths are unimodal are A332638.
Compositions whose negation is not unimodal are A332669.
The case of run-lengths of compositions is A332833.
Compositions that are neither increasing nor decreasing are A332834.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],!Or[LessEqual@@Length/@Split[#],GreaterEqual@@Length/@Split[#]]&]],{n,0,30}]

A332294 Number of unimodal permutations of a multiset whose multiplicities are the prime indices of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 1, 4, 3, 4, 1, 6, 1, 5, 4, 8, 1, 9, 1, 8, 5, 6, 1, 12, 4, 7, 9, 10, 1, 12, 1, 16, 6, 8, 5, 18, 1, 9, 7, 16, 1, 15, 1, 12, 12, 10, 1, 24, 5, 16, 8, 14, 1, 27, 6, 20, 9, 11, 1, 24, 1, 12, 15, 32, 7, 18, 1, 16, 10, 20, 1, 36, 1, 13, 16, 18, 6
Offset: 1

Views

Author

Gus Wiseman, Feb 21 2020

Keywords

Comments

This multiset is generally not the same as the multiset of prime indices of n. For example, the prime indices of 12 are {1,1,2}, while a multiset whose multiplicities are {1,1,2} is {1,1,2,3}.
A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.

Examples

			The a(12) = 6 permutations:
  {1,1,2,3}
  {1,1,3,2}
  {1,2,3,1}
  {1,3,2,1}
  {2,3,1,1}
  {3,2,1,1}
		

Crossrefs

Dominated by A318762.
A less interesting version is A332288.
The complement is counted by A332672.
The opposite/negative version is A332741.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Partitions whose run-lengths are unimodal are A332280.

Programs

  • Mathematica
    nrmptn[n_]:=Join@@MapIndexed[Table[#2[[1]],{#1}]&,If[n==1,{},Flatten[Cases[FactorInteger[n]//Reverse,{p_,k_}:>Table[PrimePi[p],{k}]]]]];
    unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
    Table[Length[Select[Permutations[nrmptn[n]],unimodQ]],{n,0,30}]

Formula

a(n) + A332672(n) = A318762(n).
a(n) = A332288(A181821(n)).

A332579 Number of integer partitions of n covering an initial interval of positive integers with non-unimodal run-lengths.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 3, 4, 7, 8, 10, 14, 19, 22, 30, 36, 43, 56, 69, 80, 101, 121, 141, 172, 202, 234, 282, 332, 384, 452, 527, 602, 706, 815, 929, 1077, 1236, 1403, 1615, 1842, 2082, 2379, 2702, 3044, 3458, 3908, 4388, 4963, 5589, 6252
Offset: 0

Views

Author

Gus Wiseman, Feb 25 2020

Keywords

Comments

A sequence of positive integers is unimodal if it is the concatenation of a weakly increasing and a weakly decreasing sequence.
Also the number of strict integer partitions of n whose negated first differences (assuming the last part is zero) are not unimodal.

Examples

			The a(10) = 1 through a(16) = 7 partitions:
  33211  332111  3321111  333211    433211     443211      443221
                          33211111  3332111    4332111     3333211
                                    332111111  33321111    4432111
                                               3321111111  33322111
                                                           43321111
                                                           333211111
                                                           33211111111
		

Crossrefs

The complement is counted by A332577.
Not requiring the partition to cover an initial interval gives A332281.
The opposite version is A332286.
A version for compositions is A332743.
Partitions covering an initial interval of positive integers are A000009.
Unimodal compositions are A001523.
Non-unimodal permutations are A059204.
Non-unimodal compositions are A115981.
Non-unimodal normal sequences are A328509.
Numbers whose prime signature is not unimodal are A332282.
Partitions whose 0-appended first differences are unimodal are A332283.
Compositions whose negated run-lengths are not unimodal are A332727.

Programs

  • Mathematica
    normQ[m_]:=m=={}||Union[m]==Range[Max[m]];
    unimodQ[q_]:=Or[Length[q]<=1,If[q[[1]]<=q[[2]],unimodQ[Rest[q]],OrderedQ[Reverse[q]]]];
    Table[Length[Select[IntegerPartitions[n],normQ[#]&&!unimodQ[Length/@Split[#]]&]],{n,0,30}]

A128422 Projective plane crossing number of K_{4,n}.

Original entry on oeis.org

0, 0, 0, 2, 4, 6, 10, 14, 18, 24, 30, 36, 44, 52, 60, 70, 80, 90, 102, 114, 126, 140, 154, 168, 184, 200, 216, 234, 252, 270, 290, 310, 330, 352, 374, 396, 420, 444, 468, 494, 520, 546, 574, 602, 630, 660, 690, 720, 752, 784, 816, 850, 884, 918, 954, 990, 1026
Offset: 1

Views

Author

Eric W. Weisstein, Mar 02 2007

Keywords

Comments

From Gus Wiseman, Oct 15 2020: (Start)
Also the number of 3-part compositions of n that are neither strictly increasing nor weakly decreasing. The set of numbers k such that row k of A066099 is such a composition is the complement of A333255 (strictly increasing) and A114994 (weakly decreasing) in A014311 (triples). The a(4) = 2 through a(9) = 14 compositions are:
(1,1,2) (1,1,3) (1,1,4) (1,1,5) (1,1,6) (1,1,7)
(1,2,1) (1,2,2) (1,3,2) (1,3,3) (1,4,3) (1,4,4)
(1,3,1) (1,4,1) (1,4,2) (1,5,2) (1,5,3)
(2,1,2) (2,1,3) (1,5,1) (1,6,1) (1,6,2)
(2,3,1) (2,1,4) (2,1,5) (1,7,1)
(3,1,2) (2,2,3) (2,2,4) (2,1,6)
(2,3,2) (2,3,3) (2,2,5)
(2,4,1) (2,4,2) (2,4,3)
(3,1,3) (2,5,1) (2,5,2)
(4,1,2) (3,1,4) (2,6,1)
(3,2,3) (3,1,5)
(3,4,1) (3,2,4)
(4,1,3) (3,4,2)
(5,1,2) (3,5,1)
(4,1,4)
(4,2,3)
(5,1,3)
(6,1,2)
(End)

Crossrefs

A007997 counts the complement.
A337482 counts these compositions of any length.
A337484 is the non-strict/non-strict version.
A000009 counts strictly increasing compositions, ranked by A333255.
A000041 counts weakly decreasing compositions, ranked by A114994.
A001523 counts unimodal compositions (strict: A072706).
A007318 and A097805 count compositions by length.
A032020 counts strict compositions, ranked by A233564.
A225620 ranks weakly increasing compositions.
A333149 counts neither increasing nor decreasing strict compositions.
A333256 ranks strictly decreasing compositions.
A337483 counts 3-part weakly increasing or weakly decreasing compositions.

Programs

  • Mathematica
    Table[Floor[((n - 2)^2 + (n - 2))/3], {n, 1, 100}] (* Vladimir Joseph Stephan Orlovsky, Jan 31 2012 *)
    Table[Ceiling[n^2/3] - n, {n, 20}] (* Eric W. Weisstein, Sep 07 2018 *)
    Table[(3 n^2 - 9 n + 4 - 4 Cos[2 n Pi/3])/9, {n, 20}] (* Eric W. Weisstein, Sep 07 2018 *)
    LinearRecurrence[{2, -1, 1, -2, 1}, {0, 0, 0, 2, 4, 6}, 20] (* Eric W. Weisstein, Sep 07 2018 *)
    CoefficientList[Series[-2 x^3/((-1 + x)^3 (1 + x + x^2)), {x, 0, 20}], x] (* Eric W. Weisstein, Sep 07 2018 *)
    Table[Length[Select[Join@@Permutations/@IntegerPartitions[n,{3}],!Less@@#&&!GreaterEqual@@#&]],{n,15}] (* Gus Wiseman, Oct 15 2020 *)
  • PARI
    a(n)=(n-1)*(n-2)\3 \\ Charles R Greathouse IV, Jun 06 2013

Formula

a(n) = floor(n/3)*(2n-3(floor(n/3)+1)).
a(n) = ceiling(n^2/3) - n. - Charles R Greathouse IV, Jun 06 2013
G.f.: -2*x^4 / ((x-1)^3*(x^2+x+1)). - Colin Barker, Jun 06 2013
a(n) = floor((n - 1)(n - 2) / 3). - Christopher Hunt Gribble, Oct 13 2009
a(n) = 2*A001840(n-3). - R. J. Mathar, Jul 21 2015
a(n) = A000217(n-2) - A001399(n-6) - A001399(n-3). - Gus Wiseman, Oct 15 2020
Sum_{n>=4} 1/a(n) = 10/3 - Pi/sqrt(3). - Amiram Eldar, Sep 27 2022
Previous Showing 11-20 of 40 results. Next