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.

A358169 Row n lists the first differences plus one of the prime indices of n with 1 prepended.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Nov 01 2022

Keywords

Comments

Every nonempty composition appears as a row exactly once.
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. Here this multiset is regarded as a sequence in weakly increasing order.
Also the reversed augmented differences of the integer partition with Heinz number n, where the augmented differences aug(q) of a sequence q of length k are given by aug(q)i = q_i - q{i+1} + 1 if i < k and aug(q)_k = q_k, and the Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). The non-reversed version is A355534.

Examples

			Triangle begins:
   2: 1
   3: 2
   4: 1 1
   5: 3
   6: 1 2
   7: 4
   8: 1 1 1
   9: 2 1
  10: 1 3
  11: 5
  12: 1 1 2
  13: 6
  14: 1 4
  15: 2 2
  16: 1 1 1 1
  17: 7
  18: 1 2 1
  19: 8
  20: 1 1 3
		

Crossrefs

Row-lengths are A001222.
The first term of each row is A055396.
Row-sums are A252464.
The rows appear to be ranked by A253566.
Another variation is A287352.
Constant rows have indices A307824.
The Heinz numbers of the rows are A325351.
Strict rows have indices A325366.
Row-minima are A355531, also A355524 and A355525.
Row-maxima are A355532, non-augmented A286470, also A355526.
Reversing rows gives A355534.
The non-augmented version A355536, also A355533.
A112798 lists prime indices, sum A056239.

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Table[Differences[Prepend[primeMS[n],1]]+1,{n,30}]