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.

A273288 Largest prime not exceeding the median of all prime divisors of n counted with multiplicity.

Original entry on oeis.org

2, 3, 2, 5, 2, 7, 2, 3, 3, 11, 2, 13, 3, 3, 2, 17, 3, 19, 2, 5, 5, 23, 2, 5, 7, 3, 2, 29, 3, 31, 2, 7, 7, 5, 2, 37, 7, 7, 2, 41, 3, 43, 2, 3, 11, 47, 2, 7, 5, 7, 2, 53, 3, 7, 2, 11, 13, 59, 2, 61, 13, 3, 2, 7, 3, 67, 2, 13, 5, 71, 2, 73, 19, 5, 2, 7, 3, 79, 2, 3, 19
Offset: 2

Views

Author

Giuseppe Coppoletta, May 25 2016

Keywords

Comments

A020639(n)<= a(n)<= A273289(n).
a(n) = n iff n is prime.

Examples

			a(66) = 3 because the median of [2, 3, 11] is the central value 3 (and it is prime).
a(308) = 3 because the median of [2, 2, 7, 11] is (2+7)/2 = 4.5 and the previous prime is 3.
		

Crossrefs

Programs

  • Mathematica
    Table[Prime@ PrimePi@ Median@ Flatten@ Apply[Table[#1, {#2}] &, FactorInteger@ n, 1], {n, 2, 82}] (* Michael De Vlieger, May 27 2016 *)
  • Sage
    r = lambda n: [f[0] for f in factor(n) for _ in range(f[1])]; [previous_prime(floor(median(r(n)))+1) for n in (2..100)]