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-2 of 2 results.

A109422 Numbers n such that tau(n)/bigomega(n) is not an integer [tau(n) =number of divisors of n; bigomega(n)=number of prime divisors of n, counted with multiplicities].

Original entry on oeis.org

4, 8, 9, 16, 25, 27, 30, 32, 36, 42, 49, 64, 66, 70, 72, 78, 81, 100, 102, 105, 108, 110, 114, 120, 121, 125, 128, 130, 138, 144, 154, 165, 168, 169, 170, 174, 180, 182, 186, 190, 195, 196, 200, 216, 222, 225, 230, 231, 238, 240, 243, 246, 252, 255, 256, 258
Offset: 1

Views

Author

Emeric Deutsch, Jun 28 2005

Keywords

Comments

Integers greater than 1 and not in A109421.

Examples

			16 is in the sequence because tau(16)=5 (1,2,4,8,16) and bigomega(16)=4 (2,2,2,2) and so tau(16)/bigomega(16)=5/4.
12 is not in the sequence because tau(12)=6 (1,2,3,4,6,12) and bigomega(12)=3 (2,2,3) and so tau(12)/bigomega(12)=2
		

Crossrefs

Complement of A109421.

Programs

  • Maple
    with(numtheory): b:=proc(n) if type(tau(n)/bigomega(n),integer)=false then n else fi end: seq(b(n),n=2..300);
  • Mathematica
    PrimeOmega[n_] := Plus @@ FactorInteger[n][[All, 2]]; Select[Range[2, 300], ! IntegerQ[DivisorSigma[0, #]/PrimeOmega[#]] &] (* Jean-François Alcover, May 02 2013 *)
    Select[Range[2,300],!IntegerQ[DivisorSigma[0,#]/PrimeOmega[#]]&] (* Harvey P. Dale, Jun 11 2022 *)

A175786 Numbers n such that the number of prime divisors of n (counted with multiplicity) is not a divisor of phi(n).

Original entry on oeis.org

8, 12, 20, 30, 32, 44, 48, 50, 54, 64, 66, 68, 72, 75, 80, 81, 92, 96, 102, 108, 110, 112, 116, 120, 125, 128, 138, 160, 162, 164, 165, 168, 170, 174, 180, 188, 192, 208, 212, 230, 236, 240, 242, 243, 246, 252, 255, 270, 272, 275, 280, 282, 284, 288, 290, 304
Offset: 1

Views

Author

Enrique Pérez Herrero, Sep 04 2010

Keywords

Comments

a(n) is in the sequence if A001222(n) does not divides A000010(n).

Crossrefs

Programs

  • Mathematica
    Select[Range[2,400],Mod[EulerPhi[#],PrimeOmega[#]]!=0&] (* Harvey P. Dale, Mar 14 2020 *)
  • PARI
    isok(n) =  (eulerphi(n) % bigomega(n)); \\ Michel Marcus, Aug 27 2013
Showing 1-2 of 2 results.