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.

A332289 Number of widely alternately co-strongly normal integer partitions of n.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1
Offset: 0

Views

Author

Gus Wiseman, Feb 13 2020

Keywords

Comments

An integer partition is widely alternately co-strongly normal if either it is all 1's (wide) or it covers an initial interval of positive integers (normal) and has weakly increasing run-lengths (co-strong) which, if reversed, are themselves a widely alternately co-strongly normal partition.

Examples

			The a(1) = 1, a(3) = 2, and a(10) = 3 partitions:
  (1)  (21)   (4321)
       (111)  (322111)
              (1111111111)
For example, starting with y = (4,3,2,2,1,1,1) and repeatedly taking run-lengths and reversing gives y -> (3,2,1,1) -> (2,1,1) -> (2,1) -> (1,1). These are all normal, have weakly increasing run-lengths, and the last is all 1's, so y is counted a(14).
		

Crossrefs

Normal partitions are A000009.
Dominated by A317245.
The non-co-strong version is A332277.
The total (instead of alternate) version is A332278.
The Heinz numbers of these partitions are A332290.
The strong version is A332292.
The case of reversed partitions is (also) A332292.
The generalization to compositions is A332340.

Programs

  • Mathematica
    totnQ[ptn_]:=Or[ptn=={},Union[ptn]=={1},And[Union[ptn]==Range[Max[ptn]],LessEqual@@Length/@Split[ptn],totnQ[Reverse[Length/@Split[ptn]]]]];
    Table[Length[Select[IntegerPartitions[n],totnQ]],{n,0,30}]