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-2 of 2 results.

A238788 Number of palindromic partitions of n whose least part has multiplicity <= 2.

Original entry on oeis.org

1, 2, 1, 3, 3, 4, 4, 7, 6, 11, 9, 13, 15, 22, 18, 29, 28, 40, 38, 55, 52, 75, 70, 97, 96, 133, 123, 173, 167, 225, 215, 291, 282, 380, 361, 479, 468, 619, 590, 780, 757, 986, 952, 1239, 1202, 1555, 1500, 1931, 1882, 2409, 2328, 2975, 2898, 3676, 3568, 4517
Offset: 1

Views

Author

Clark Kimberling, Mar 05 2014

Keywords

Comments

Palindromic partitions are defined at A025065.

Examples

			a(8) counts these 7 partitions (written as palindromes):  8, 161, 44, 242, 323, 1331, 12221

Crossrefs

Cf. A025065, A238789, A238790, A238779.

Programs

  • Mathematica
    z = 40; p[n_, k_] := Select[IntegerPartitions[n], (Count[OddQ[Transpose[Tally[#]][[2]]], True] <= 1) && (Count[#, Min[#]] <= k) &]
Table[p[n, 2], {n, 1, 12}]
t2 = Table[Length[p[n, 2]], {n, 1, z}]  (* A238788 *)
Table[p[n, 3], {n, 1, 12}]
t3 = Table[Length[p[n, 3]], {n, 1, z}]  (* A238789 *)
Table[p[n, 4], {n, 1, 12}]
t4 = Table[Length[p[n, 4]], {n, 1, z}]  (* A238790 *)
(* Peter J. C. Moses, Mar 03 2014 *)

A238789 Number of palindromic partitions of n whose least part has multiplicity <= 3.

Original entry on oeis.org

1, 2, 2, 3, 3, 5, 5, 7, 8, 11, 11, 15, 17, 23, 23, 30, 33, 43, 46, 57, 62, 79, 83, 103, 112, 139, 148, 180, 195, 236, 253, 304, 330, 396, 422, 501, 543, 644, 690, 810, 876, 1027, 1105, 1286, 1388, 1614, 1734, 2004, 2165, 2496, 2684, 3081, 3324, 3808, 4096
Offset: 1

Views

Author

Clark Kimberling, Mar 05 2014

Keywords

Comments

Palindromic partitions are defined at A025065.

Examples

			a(9) counts these 8 partitions (written as palindromes):  9, 171, 252, 414, 333, 13131, 12321, 22122.

Crossrefs

Cf. A025065, A238788, A238790, A238779.

Programs

  • Mathematica
    z = 40; p[n_, k_] := Select[IntegerPartitions[n], (Count[OddQ[Transpose[Tally[#]][[2]]], True] <= 1) && (Count[#, Min[#]] <= k) &]
Table[p[n, 2], {n, 1, 12}]
t2 = Table[Length[p[n, 2]], {n, 1, z}]  (* A238788 *)
Table[p[n, 3], {n, 1, 12}]
t3 = Table[Length[p[n, 3]], {n, 1, z}]  (* A238789 *)
Table[p[n, 4], {n, 1, 12}]
t4 = Table[Length[p[n, 4]], {n, 1, z}]  (* A238790 *)
(* Peter J. C. Moses, Mar 03 2014 *)
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.