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.

Showing 1-1 of 1 results.

A376384 Numbers k such that there exists at least two m <= k such that both rad(m) | k and m is neither squarefree nor a prime power, i.e., m is in A126706, where rad = A007947.

Original entry on oeis.org

18, 24, 30, 36, 40, 42, 48, 50, 54, 56, 60, 66, 70, 72, 75, 78, 80, 84, 88, 90, 96, 98, 100, 102, 104, 105, 108, 110, 112, 114, 120, 126, 130, 132, 135, 136, 138, 140, 144, 147, 150, 152, 154, 156, 160, 162, 165, 168, 170, 174, 176, 180, 182, 184, 186, 189, 190
Offset: 1

Views

Author

Michael De Vlieger, Oct 02 2024

Keywords

Comments

Numbers k such that A376505(k) > 1. A376505(k) >= 1 for all k in A126706.
Numbers k such that the cardinality of the intersection of row n of A162306 and A126706 exceeds 1.
Excludes prime powers; subsequence of A024619.
a(n) is not in A366825, since for k in A366825, there is only one m <= k that is in A126706, and that is k itself.

Examples

			Table showing the intersection of A126706 and row a(n) of A162306 for n = 1..12:
18: {12, 18},
24: {12, 18, 24},
30: {12, 18, 20, 24},
36: {12, 18, 24, 36},
40: {20, 40},
42: {12, 18, 24, 28, 36},
48: {12, 18, 24, 36, 48},
50: {20, 40, 50},
54: {12, 18, 24, 36, 48, 54},
56: {28, 56},
60: {12, 18, 20, 24, 36, 40, 45, 48, 50, 54, 60},
66: {12, 18, 24, 36, 44, 48, 54}.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[2^8], Function[n, 1 < Count[Range[n], _?(And[Divisible[n, Times @@ FactorInteger[#][[All, 1]]], Nor[SquareFreeQ[#], PrimePowerQ[#]]] &)] ] ]

Formula

a(n) = card({ m <= a(n) : rad(m) | a(n), Omega(m) > omega(m) > 1 }), where Omega = A001222 and omega = A001221.
Showing 1-1 of 1 results.