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.

Previous Showing 21-22 of 22 results.

A371181 Sorted list of positions of first appearances in the sequence A370820, which counts distinct divisors of prime indices.

Original entry on oeis.org

1, 2, 3, 7, 13, 37, 53, 89, 151, 223, 281, 311, 659, 827, 1069, 1163, 1511, 2045, 2423, 3241, 4211, 5443, 6473, 6997, 7561, 9037, 10271, 10627, 14323, 17611, 26203, 28181, 33613, 50543, 88099, 88483, 95603, 98965, 122119, 168281, 192709, 305107, 309073, 420167
Offset: 1

Views

Author

Gus Wiseman, Mar 20 2024

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 terms together with their prime indices begin:
       1: {}
       2: {1}
       3: {2}
       7: {4}
      13: {6}
      37: {12}
      53: {16}
      89: {24}
     151: {36}
     223: {48}
     281: {60}
     311: {64}
     659: {120}
     827: {144}
    1069: {180}
    1163: {192}
    1511: {240}
    2045: {3,80}
    2423: {360}
    3241: {4,90}
    4211: {576}
    5443: {720}
    6473: {840}
    6997: {900}
    7561: {960}
    9037: {4,210}
		

Crossrefs

Counting prime factors instead of divisors (see A303975) gives A062447(>0).
The unsorted version is A371131.
A000005 counts divisors.
A001221 counts distinct prime factors.
A003963 gives product of prime indices.
A027746 lists prime factors, A112798 indices, length A001222.
A355731 counts choices of a divisor of each prime index, firsts A355732.
A355741 counts choices of a prime factor of each prime index.

Programs

  • Mathematica
    rnnm[q_]:=Max@@Select[Range[Min@@q,Max@@q],SubsetQ[q,Range[#]]&];
    posfirsts[q_]:=Table[Position[q,n][[1,1]],{n,Min@@q,rnnm[q]}];
    posfirsts[Table[Length[Union @@ Divisors/@PrimePi/@First/@If[n==1,{},FactorInteger[n]]],{n,1000}]]//Sort

A371287 Numbers whose product of prime indices has exactly two distinct prime factors.

Original entry on oeis.org

13, 15, 26, 29, 30, 33, 35, 37, 39, 43, 45, 47, 51, 52, 55, 58, 60, 61, 65, 66, 69, 70, 71, 73, 74, 75, 77, 78, 79, 85, 86, 87, 89, 90, 91, 93, 94, 95, 99, 101, 102, 104, 105, 107, 110, 111, 116, 117, 119, 120, 122, 123, 129, 130, 132, 135, 137, 138, 139, 140
Offset: 1

Views

Author

Gus Wiseman, Mar 21 2024

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 terms together with their prime indices begin:
  13: {6}
  15: {2,3}
  26: {1,6}
  29: {10}
  30: {1,2,3}
  33: {2,5}
  35: {3,4}
  37: {12}
  39: {2,6}
  43: {14}
  45: {2,2,3}
  47: {15}
  51: {2,7}
  52: {1,1,6}
  55: {3,5}
  58: {1,10}
  60: {1,1,2,3}
		

Crossrefs

Positions of 2's in A303975 (positions of 1's are A320698).
Counting divisors (not factors) gives A371127, positions of 2's in A370820.
A000005 counts divisors.
A000961 lists powers of primes, of prime index A302596.
A001221 counts distinct prime factors.
A001358 lists semiprimes, squarefree A006881.
A003963 gives product of prime indices.
A027746 lists prime factors, indices A112798, length A001222.
A076610 lists products of primes of prime index.
A355731 counts choices of a divisor of each prime index, firsts A355732.
A355741 counts choices of a prime factor of each prime index.

Programs

  • Mathematica
    Select[Range[100],2==PrimeNu[Times @@ PrimePi/@First/@If[#==1,{},FactorInteger[#]]]&]

Formula

A001221(A003963(a(n))) = A303975(a(n)) = 2.
Previous Showing 21-22 of 22 results.