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.

A335549 Number of normal patterns matched by the multiset of prime indices of n in weakly increasing order.

Original entry on oeis.org

1, 2, 2, 3, 2, 3, 2, 4, 3, 3, 2, 5, 2, 3, 3, 5, 2, 5, 2, 5, 3, 3, 2, 7, 3, 3, 4, 5, 2, 4, 2, 6, 3, 3, 3, 7, 2, 3, 3, 7, 2, 4, 2, 5, 5, 3, 2, 9, 3, 5, 3, 5, 2, 7, 3, 7, 3, 3, 2, 7, 2, 3, 5, 7, 3, 4, 2, 5, 3, 4, 2, 10, 2, 3, 5, 5, 3, 4, 2, 9, 5, 3, 2, 7, 3, 3, 3
Offset: 1

Views

Author

Gus Wiseman, Jun 21 2020

Keywords

Comments

First differs from A181796 at a(90) = 8 A181796(90) = 7.
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.
We define a (normal) pattern to be a finite sequence covering an initial interval of positive integers. Patterns are counted by A000670 and ranked by A333217. A sequence S is said to match a pattern P if there is a not necessarily contiguous subsequence of S whose parts have the same relative order as P. For example, (3,1,1,3) matches (1,1,2), (2,1,1), and (2,1,2), but avoids (1,2,1), (1,2,2), and (2,2,1).

Examples

			The Heinz number of (1,2,2,3) is 90 and it matches 8 patterns: (), (1), (11), (12), (112), (122), (123), (1223); so a(90) = 8.
		

Crossrefs

The version for standard compositions instead of prime indices is A335454.
Permutations of prime indices are counted by A008480.
Permutations are counted by A000142 and ranked by A333218.
Patterns are counted by A000670 and ranked by A333217.
Subset-sums are counted by A304792 and ranked by A299701.
Patterns matched by compositions of n are counted by A335456(n).
Minimal patterns avoided by a standard composition are counted by A335465.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    mstype[q_]:=q/.Table[Union[q][[i]]->i,{i,Length[Union[q]]}];
    Table[Length[Union[mstype/@Subsets[primeMS[n]]]],{n,100}]