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.

A387523 Primes in the order in which they first divide a term of A386482.

Original entry on oeis.org

2, 3, 5, 7, 13, 11, 17, 19, 23, 29, 31, 43, 41, 37, 47, 67, 61, 59, 53, 73, 71, 83, 79, 113, 109, 107, 103, 101, 97, 89, 127, 157, 151, 149, 139, 137, 131, 193, 191, 181, 179, 173, 167, 163, 199, 197, 211, 251, 241, 239, 233, 229, 227, 223, 313, 311, 307, 293, 283, 281, 277, 271, 269, 263, 257, 337, 331, 317, 467, 463, 461, 457
Offset: 1

Views

Author

N. J. A. Sloane, Sep 03 2025

Keywords

Comments

Conjecture: if c is the first term in A386482 that is divisible by a prime p > 2, then c = 2*p.

Examples

			11 first divides A386482(23), but 13 first divides A386482(21), so 13 precedes 11 in this sequence.
		

Crossrefs

Programs

  • Mathematica
    Block[{p, s}, p[A386482/b386482.txt%22,%20%22Data%22%5D%5B%5BAll,%20-1%5D%5D;%20Rest@%20Reap%5BDo%5BMap%5BIf%5Bp%5B%23%5D%20==%200,%20Set%5Bp%5B%23%5D,%20n%5D;%20Sow%5B%23%5D%5D%20&,%20FactorInteger%5Bs%5B%5Bn%5D%5D%20%5D%5B%5B;;%20,%201%5D%5D%5D,%20%7Bn,%20Length%5Bs%5D%7D%5D%20%5D%5B%5B-1,%201%5D%5D%20%5D%20(*%20_Michael%20De%20Vlieger">] := 0; s = Import["https://oeis.org/A386482/b386482.txt", "Data"][[All, -1]]; Rest@ Reap[Do[Map[If[p[#] == 0, Set[p[#], n]; Sow[#]] &, FactorInteger[s[[n]] ][[;; , 1]]], {n, Length[s]}] ][[-1, 1]] ] (* _Michael De Vlieger, Sep 03 2025 *)