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.

A360676 Sum of the left half (exclusive) of the prime indices of n.

Original entry on oeis.org

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

Views

Author

Gus Wiseman, Mar 04 2023

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.

Examples

			The prime indices of 810 are {1,2,2,2,2,3}, with left half (exclusive) {1,2,2}, so a(810) = 5.
The prime indices of 3675 are {2,3,3,4,4}, with left half (exclusive) {2,3}, so a(3675) = 5.
		

Crossrefs

Positions of 0's are 1 and A000040.
Positions of first appearances are 1 and A001248.
These partitions are counted by A360675, right A360672.
A112798 lists prime indices, length A001222, sum A056239, median* A360005.
A360616 gives half of bigomega (exclusive), inclusive A360617.
A360673 counts multisets by right sum (exclusive), inclusive A360671.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.

Programs

  • Maple
    f:= proc(n) local F,i,t;
      F:= [seq(numtheory:-pi(t[1])$t[2], t = sort(ifactors(n)[2],(a,b) -> a[1] < b[1]))];
      add(F[i],i=1..floor(nops(F)/2))
    end proc:
    map(f, [$1..100]); # Robert Israel, Feb 02 2025
  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Table[Total[Take[prix[n],Floor[Length[prix[n]]/2]]],{n,100}]

Formula

A360676(n) + A360679(n) = A001222(n).
A360677(n) + A360678(n) = A001222(n).